CPP
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
#include<stdio.h>
/*
Fibonacci series:
0,1,1,2,3,5,8..etc
numbers series
1,2,3,4,5,6,7..etc
*/
//recursion
int f(int n){
return (n<=1)?n:f(n-1)+f(n-2);
}
//loop
long f2(long n){
n-=1;
if(n==0){return 0;}
if(n==1){return 1;}
long cache[n];
cache[0]=0;
cache[1]=1;
printf("[%d]=>%ld\n",1,cache[0]);
printf("[%d]=>%ld\n",2,cache[1]);
for(long i=2;i<=n;++i){
cache[i]=cache[i-2]+cache[i-1];
printf("[%ld]=>%ld\n",i+1,cache[i]);
}
return cache[n];
}
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run