2014-11-10 HW20

posted Nov 10, 2014, 11:29 AM by Samuel Konstantinovich   [ updated Nov 10, 2014, 11:29 AM ]
1. Complete:
(fibHelp n current previous) -> tail recursive Fibonacci function.
(fib n) -> wrapper function that calculates the Nth Fibonacci number using the fibHelp function.

2. Test your function on values you know to make sure that it works. Test your functions on larger numbers that would not work on your original fib function. 

3. Print your header, functions, and test cases + results for Wednesday.