Abstract
Abstract This paper presents a detailed derivation of a recursive algorithm for computing Fibonacci numbers in log time, using Dijkstra’s methodology. A comparison with Martin and Rem’s iterative algorithm for doing the same task shows that the recursive algorithm uses less number of variables and introduces no ghost variables at all, and is therefore less complex. Furthermore, the iterative algorithm runs 50% slower than the recursive algorithm, on average.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
