Ask a Question

 

Start Coding Today

   

GeeksQuiz

GeeksforGeeksIDE

Data Structures

Algorithms

Interview Experiences

C Programming

C++ Programming

Java Programming

GATE CS

Books

Nth Fibonacci number in o (logN)

this is an amazon question :

Can you find the Nth Fibonacci number in O(log N) time complexity ???

asked Dec 18, 2015 by ApLav

1 Answer

+1 vote
 
Best answer

Please visit this link - http://www.geeksforgeeks.org/program-for-nth-fibonacci-number/

All methods(including O(log n)) with complete explanation are given.

answered Dec 18, 2015 by utkarsh111
selected Dec 18, 2015 by ApLav

Thank You so much. I saw the link. Very useful.

Please log in or register to answer this question.

...