Fibonacci

Baekjoon2747

Fibonacci Without Dynamic Programming

Step1: Problem Analysis
Base case
Fib(0)=0, Fib(1)=1
Other cases
Fibo(n) = Fibo(n-1)+Fibo(n-2)
Solution
-Recursive & Dynamic ProgrammingX
Step2: Solve Manually
Skip
Step3: Pseudo Code


Step4: Implement Code
https://gist.github.com/growingpenguin/e3b15bfc9e3804b656632d5c126ec377

Fibonacci With Dynamic Programming

Step1: Problem Analysis


Step2: Solve Manually

Step3: Pseudo Code
Top Down Approach

Bottom Up Approach

Step4: Implement Code
Top Down Approach
https://gist.github.com/growingpenguin/40dea7ba0ecce71354f46d11caa93951
Bottom Up Approach
https://gist.github.com/growingpenguin/fbd50408b0cb6d8cf4e178b01eff95cf