|
1 | 1 | # Matlab Dynamic Programming |
2 | 2 |
|
3 | | -MATLAB Code: Solve Fibonacci Numbers using Dynamic Programming, Memoization |
| 3 | +MATLAB Code: Solve Fibonacci Numbers using **Dynamic Programming**, Memoization Implementation in MATLAB |
4 | 4 |
|
5 | | -Implementation in MATLAB |
6 | 5 |
|
7 | | - |
8 | | -Fibo1.m \ |
9 | | -Fibonacci with Recursive approach:\ |
10 | | - Time Complexity: O(2^n)\ |
11 | | - Space Complexity: O(2^n) |
| 6 | +**Fibo1.m: Fibonacci with Recursive approach:**\ |
| 7 | + - Time Complexity: O(2^n) |
| 8 | + - Space Complexity: O(2^n) |
12 | 9 |
|
13 | | -Fibo2.m \ |
14 | | -Fibonacci with Dynamic programming (Memoization):\ |
15 | | - Time Complexity: O(n)\ |
16 | | - Space Complexity: O(n) |
| 10 | +**Fibo2.m: Fibonacci with Dynamic programming (Memoization):**\ |
| 11 | + - Time Complexity: O(n) |
| 12 | + - Space Complexity: O(n) |
17 | 13 |
|
18 | | -Fibo3.m \ |
19 | | -Fibonacci with Matrix Exponentiation:\ |
20 | | - Time Complexity: O(log(n)) |
| 14 | +**Fibo3.m: Fibonacci with Matrix Exponentiation:**\ |
| 15 | + - Time Complexity: O(log(n)) |
21 | 16 |
|
22 | 17 |
|
23 | 18 |
|
24 | 19 | ## How to use |
25 | 20 |
|
26 | | -Just run the EVAL.m file to compare run time of three methods: \ |
27 | | - 1) Fibo using Recursive method\ |
28 | | - 2) Fibo using Dynamic programming\ |
29 | | - 3) Fibo using Matrix Exponentiation (Fastest method) |
| 21 | +Just run the **EVAL.m** file to compare run-time of three methods: \ |
| 22 | + |
| 23 | + 1- Fibo using **Recursive method** |
| 24 | + 2- Fibo using **Dynamic programming** |
| 25 | + 3- Fibo using **Matrix Exponentiation** (Fastest method) |
30 | 26 |
|
0 commit comments