Nama : Nurroh Galbie

NPM : 2107051028
STRUKTUR DATA
A. Halaman 4
kode program 1 = Kode program
#include <stdio.h>
#include <stdlib.h>
void rekursi();
int main(int argc, char*argv[]) {
rekursi(); return 0;
}
void rekursi(){
printf("Rekursi\n"); rekursi();
}
Screenshot :
kode program 2 = Kode Program
#include <stdio.h>
#include <stdlib.h>
void rekursi(int val);
int main(int argc, char *argv[]) {
rekursi(3);
return 0;
}
void rekursi(int val){
if (val>0) {
printf("Step in recursion -> val : %d\n", val);
rekursi(--val);
printf("Step after recursion -> val : %d\n", val);
}
}
Screenshot :
kode program 3 = Kode program
#include <stdio.h>
#include <stdlib.h>
void rekursi(int level);
int main(int argc, char *argv[]) {
rekursi(10);
return 0;
}
void rekursi(int level){
if (level>0) {
printf("Rekursi: %d\n",level);
rekursi(--level);
}
}
Screenshot :
B. halaman 8
kode program 1 = 1.
Kode program
#include <iostream>
#include <conio.h>
#include <math.h>
using namespace std;
int kali (int m,int n) {
int i, hasil =0;
for(i=1;i<=abs(n);i++)
hasil+=m;
if(n<0){
return(-hasil);
} else{
return(hasil);
}
}
int main() {
int a,b;
cout <<"Bilangan a : "; cin >> a;
cout <<"Bilangan b: "; cin >> b;
cout << "Hasil kali "<<a<<" x "<<b<<" = " <<kali(a,b); getch();
}

Screenshot :
kode program 2 = 2.
#include <cstdio>
using namespace std;
typedef int array[100];
int input (int* x, int n) {
int i=0;
for (;i<n;) {
printf("Array[%d]:",i);
scanf("%d",&x[i]);
i++;
}
}
int max(int* x,int n) {
int i;
if(n!=0) {
if (*(x+n)>=max(x,n-1)) {
return *(x+n);
}
} else {
return *x;
}
}
int main() {
int n, maksimum;
array a;
printf("Masukkan Nilai n: "); scanf("%d",&n); input(a,n);
maksimum = max(a,n-1);
printf("Nilai Terbesar : %d", maksimum);
}
Screenshot :
kode program 3 = 3.
Kode program
# include <stdio.h>
/* Fungsi untuk menukar nilai */
void tukar (char *x, char *y) {
char temp; temp = *x;
*x = *y;
*y = temp;
}
/* Fungsi untuk mencetak permutasi */
void permutasi(char *a, int i, int n) {
int j;
if (i == n) printf("%s\n", a); else {
for (j = i; j <= n; j++) {
tukar((a+i), (a+j)); permutasi(a, i+1, n);
tukar((a+i), (a+j)); //mengulang fungsi tukar
}
}
}
int main() {
char a[] = "abc"; permutasi(a, 0, 2); getchar();
return 0;
}
Screenshot :