Deret bilangan fibonacci: 1,1, 2, 3, 5, 8, 13, 21, 34, ,,,
f1= 1; f2= 1; fn= fn-1 + fn-2
Ä Deret bilangan fibonacci
void deretfibonacci(int n) {
int i, fn, fn1, fn2;
for (i= 1; i<= n; i++) {
if (i==1) { printf("1 "); fn1= 1; }
else
if(i==2) { printf("1 "); fn2= 1; }
else {
fn= fn1 + fn2;
printf("%d ", fn);
fn1= fn2;
fn2= fn;
}
}
}
Deret Oblong: 2, 6, 12, 20, 30, 42 , …
| == | === === | ==== ==== ==== | ===== ===== ===== ===== | ====== ====== ====== ====== ====== | ======= ======= ======= ======= ======= ======= |
Ä Deret Oblong
void deretoblong(int n) {
for (int i= 1; i<= n; i++)
printf("%d ", i * (i+1));
}
Segitiga Pascal atau Chu Shih-Chieh
| | | | | | 1 | | | | | |
| | | | | 1 | | 1 | | | | |
| | | | 1 | | 2 | | 1 | | | |
| | | 1 | | 3 | | 3 | | 1 | | |
| | 1 | | 4 | | 6 | | 4 | | 1 | |
| 1 | | 5 | | 10 | | 10 | | 5 | | 1 |
Tidak ada komentar:
Posting Komentar