gs gs122 Dynamic Programming - Fibonacci using Dynamic Programming - Quiz No.1

 int fibo(int n) if n <= 1 return n return __________

 fibonacci(8) fibonacci(7) + fibonacci(6) fibonacci(6) + fibonacci(5) + fibonacci(5) + fibonacci(4) fibonacci(5) + fibonacci(4) + fibonacci(4) + fibonacci(3) + fibonacci(4) + fibonacci(3)	+ fibonacci(3) + fibonacci(2) : : :

 #include<stdio.h> int fibo(int n) { if(n<=1) return n; return fibo(n-1) + fibo(n-2); } int main() { int r = fibo(50000); printf("%d",r); return 0; }

 int fibo(int n) if n == 0 return 0 else prevFib = 0 curFib = 1 for i : 1 to n-1 nextFib = prevFib + curFib __________ __________ return curFib

 int fibo(int n) if n == 0 return 0 else prevFib = 0 curFib = 1 for i : 1 to n-1 nextFib = prevFib + curFib prevFib = curFib curFib = nextFib return curFib

 int fibo(int n) if n == 0 return 0 else prevFib = 0 curFib = 1 for i : 1 to n-1 nextFib = prevFib + curFib prevFib = curFib curFib = nextFib return curFib

 #include<stdio.h> int fibo(int n) { if(n==0) return 0; int i; int prevFib=0,curFib=1; for(i=1;i<=n-1;i++) { int nextFib = prevFib + curFib; prevFib = curFib; curFib = nextFib; } return curFib; } int main() { int r = fibo(10); printf("%d",r); return 0; }

 1. int fibo(int n) 2.   int fibo_terms[100000]  //arr to store the fibonacci numbers 3.   fibo_terms[0] = 0 4.   fibo_terms[1] = 1 5. 6.   for i: 2 to n 7.	 fibo_terms[i] = fibo_terms[i - 1] + fibo_terms[i - 2] 8. 9.   return fibo_terms[n]

 1. int fibo(int n) 2.	int fibo_terms[100000]  //arr to store the fibonacci numbers 3.	fibo_terms[0] = 0 4.	fibo_terms[1] = 1 5. 6.	for i: 2 to n 7.		fibo_terms[i] = fibo_terms[i - 1] + fibo_terms[i - 2] 8. 9.	return fibo_terms[n]

 1. int fibo(int n) 2.	int fibo_terms[100000]  //arr to store the fibonacci numbers 3.	fibo_terms[0] = 0 4.	fibo_terms[1] = 1 5. 6.	for i: 2 to n 7.		fibo_terms[i] = fibo_terms[i - 1] + fibo_terms[i - 2] 8. 9.	return fibo_terms[n]

 int fibo(int n) int fibo_terms[100000]  //arr to store the fibonacci numbers fibo_terms[0] = 0 fibo_terms[1] = 1  for i: 2 to n fibo_terms[i] = fibo_terms[i - 1] + fibo_terms[i - 2]  return fibo_terms[n]

 #include<stdio. int fibo(int n) { int i; int fibo_terms[100]; fibo_terms[0]=0; fibo_terms[1]=1; for(i=2;i<=n;i++) fibo_terms[i] = fibo_terms[i-2] + fibo_terms[i-1]; return fibo_terms[n]; } int main() { int r = fibo(8); printf("%d",r); return 0; }