Write the code to produce the nth number in the fibonacci sequence (both recursive and iterative)
Sigiloso
def fibonacci_recur(n): # recursive version if n == 1: return 0 elif n == 2: return 1 else: return fibonacci_recur(n-2)+fibonacci_recur(n-1) def fibonacci_iter(n): #iterative version list = [0, 1] if n > 2: for i in xrange(2, n): list.append(list[i-2]+list[i-1]) return list[n-1] if __name__ == '__main__': print fibonacci_recur(6) print fibonacci_iter(7)