Hi,
Book has provided a formula for computing Fibonacci series which was discovered by A. de Moivre. The formula is given below:


Fib(n) = Φ raised to the power n/ square root of 5

Can some body please guide me what’s its running time?


Zulfi.

 

That depends on how long it takes to raise a constant to an integer power, and that depends on the algorithm used to calculate the value of a constant raised to an integer power, doesn't it?

 

Hi,
I found that the run time of power function is log(n).
http://stackoverflow.com/questions/5231096/time-complexity-of-power.

Thats the advantage of his technique otherwise the iterative version takes O(n) time.

Zulfi.