##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
LC 509 classic
Fibonacci sequence is an ideal example for recursion. To find , you just call and and add them.
What could be simpler? I'll show you why this "obvious" solution breaks down when grows big. For small like , it finishes instantly. For , your computer struggles. For , it never finishes. This problem will teach you why you need dynamic programming.
