Question

Fibonacci sequence is famous problem solved with recursion. However, this can also be done more efficiently using dynamic programming. Create a program that uses dynamic programming techniques to list the first 30 Fibonacci numbers.

Answer 1

#include <iostream>

using namespace std;

int fib[32];

int fibonacci(int n)

{

fib[0] = 0;

fib[1] = 1;

for(int i = 2; i <= n; i++)

{

fib[i] = fib[i - 1] + fib[i - 2];

}

return fib[n];

}

int main ()

{

for(int i = 0; i <= 30; i++)

cout << fibonacci(i) <<endl;

return 0;

}

=========================================================
As language was not mentioned, done in C++. Please let me know if you need in any other language.
SEE OUTPUT

Files https://ImpossibleGrowingAr main.cpp ... main.cpp #include <iostream> 2 using namespace std; 3 4 int fib[32]; 5 int fibonacci(int n) 6 > clang++-7 -pthread > ./main { 7 8 1 2 3 5 fib[0] = 0; fib[1] = 1; 9 10 11 for(int i = 2; i <= n; i++) { 12 13 fib[i] = fib[i - 1] + fib[i - 2]; 21 34 55 89 144 14 } 15 return fib[n]; 233 16 } 17 int main() { 18 19 20 21 for(int i = 0; i <= 30; i++) cout << fibonacci(i) <<endl; return 0; 22 23 } 377 610 987 1597 2584 4181 6765 10946 17711 28657 46368 75025 121393 196418 317811 514229 832040

========================================
Thanks, let me now if there is any concern.