FibonacciPerformance

This sample solution demonstrates two methods for finding Fibonacci numbers. One method uses recursive calls and the other method is implemented as flat for loop. Solution contains command line program that measures both methods when calculating Fibonacci numbers for 0 to 41.

References

• Performance of Fibonacci numbers algorithms