@@ -0,0 +1,303 @@
+def iterativeFib(n):%0A    '''%0A    assumes x an int %3E= 0%0A    returns Fibonacci of x%0A    '''%0A    assert type(n) == int and n %3E= 0%0A    a = 1%0A    b = 1%0A    count = 1%0A    result = 1%0A    while count %3C n:%0A        result = a + b%0A        c = result%0A        a = b%0A        b = c%0A        count += 1%0A    return result

add iterativer version of Fibonacci which Big-Ois O(n)