Any questions related to programming and algorithms are posted and its answer will be published in the forthcoming days..
Anyone can post their answers or ask any doubt...
This site will be very useful to those attending technical interviews and those appearing for GATE and other examinations
Wednesday, 21 March 2012
Find nth fibonacci number without traversing from the start
Write a program to find the nth fibonacci number without traversing from the start index.
ie.. the program should have a time complexity of the order of 1 [O(1)].
No comments:
Post a Comment