Solving With the FAST Method
The FAST
method consists of the following 4 steps:
- Find the first solution
- Analyze the solution
- Identify the subproblems
- Turn around the solution
Let's examine this process with the most popular example when it comes to dynamic programming, calculating the n
th Fibonacci number:
xxxxxxxxxx
0, 1, 1, 2, 3, 5, 8, 13,..n
OUTPUT
:001 > Cmd/Ctrl-Enter to run, Cmd/Ctrl-/ to comment