Dynamic Programming algorithum
===

Hi im working on an algorithum to calculate a Fibonacci number and got the pseudo code for it but I cant figure out how much time it takes to run. I think It runs at O(n) but not quite sure.
here is the code i have

    Algorithm Fast-Fibonacci(n)
    Let fib[0] and fib[1] be 1.
    for each i from 2 to n, do:
      Let fib[i] be fib[i - 2] + fib[i - 1].
    end of loop
    return fib[n].

Thanks for any help with this
