Added the Fibonacci Solution with Dynamic programmng

[mfullen]

Hello,

I wanted to add an alternate solution to the Fibonacci problem because recursion in this problem when you start to choose n at higher numbers like 50, 100 or even greater becomes unstable due to recursion being very inefficient. In fact depending on your computer's memory you may very easily run into overflow issues at a much smaller number.

The dynamic programming approach removes recursion altogether and has a much faster calculation time. I included a stop watch of both methods to illustrate the difference.

I also think Dynamic Programming is relevant because it is a commonly asked interview question type.

Good job so far and good luck.

Thanks!

[geralexgr]

Thanks for your addition @mfullen it will be added soon.