1. ### USING ITERATION ###

  3. # returns the nth term in the Fibonacci sequence
  4. def fibonacci(n):
  5.     i = 0
  6.     j = 1
  7.     for term in range(1, n):
  8.         temp = i
  9.         i = j
  10.         j += temp
  11.     return j

  13. print(fibonacci(1)) # 1
  14. print(fibonacci(2)) # 1
  15. print(fibonacci(6)) # 8
  16. print(fibonacci(12)) # 144

  18. ### USING RECURSION ###

  20. # params: i and j are intial two Fibonacci terms; n is the nth term from i
  21. # return: the nth term of the Fibonacci sequence (starting from i = 1st term)
  22. def fibonacci(i, j, n):
  23.     if (n > 0):
  24.         return fibonacci(j, i+j, n-1) # next term; reduce the number of terms left
  25.     else: # completed all terms
  26.         return i

  28. print(fibonacci(0, 1, 1)) # 1
  29. print(fibonacci(0, 1, 2)) # 1
  30. print(fibonacci(0, 1, 6)) # 8
  31. print(fibonacci(0, 1, 12)) # 144
DOWNLOAD

        Created: May 8, 2014
    Last Updated: May 15, 2014
Completed in full by: Michael Yaworski