Recursive and Iterative Fibonacci

fib.py

# lines  words  bytes

# 5  17  102
def rfib(n):
    if n == 0 or n == 1:
        return 1
    else:
        return rfib(n-1) + rfib(n-2)

# 8  23  113
def ifib(n):
    a = 0
    b = 1
    for _ in xrange(n):
        c = b
        b += a
        a = c
    return b