-
Notifications
You must be signed in to change notification settings - Fork 0
/
algoratorymeet1.cpp
48 lines (39 loc) · 950 Bytes
/
algoratorymeet1.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include<stdio.h>
int count = 0;
//Function -> simplify code
//void function
void printhello(){
printf("Hello");
}
//non-void function => can return data
int sum(int a, int b){
int hasil = a + b;
return hasil;
}
//Recursive => Fungsi memanggil fungsinya
int factorial(int n){
if(n==0 || n==1){
return 1;
count++;
}
else return n * factorial(n-1);
}
//int return(int z){
// return z;
//}
int main(){
//Recursive(floodfill+variation, rumus)
//Sorting(greedy method(bubble sort), divide and conquer(merge sort, heap sort, ))
//Statistik => cari median, q1, q3, IQR(Interquartile Range(q3-q1))
//Struct(sorting, searching)
//Searching => Cari Data
//File => buka file, load file, sorting/searching
//int hasil = sum(1,2);
//printf("%d\n",hasil);
//printhello();
printf("%d\n", factorial(5));
//printf("%d\n", return(2));
//Recursive => Fungsi memanggil diri sendiri
//Looping vs recursion => Search in google
return 0;
}