2
votes
Vote
Generating Fibonacci numbers in Delphi: Recursive and iterative algorithms
Yanniel's notes
– In this post, I want to implement a function that returns the Nth Fibonacci number. Initially, I will provide a recursive implementation that derives directly from the Fibonacci sequence definition. Afterwards, I will recode the same function using an iterative approach.Why do I want to do (share) such a thing? Well, firstly for fun :-) and secondly, because I was asked to do something similar in one phone screen interview. Really? Yep, I was asked to code a function to return the factorial of a number and then, I had to read it over the phone. I implemented the recursive algorithm. At this ...
Statistics
|
Visits by Source |
User Actions |
Users who voted for this posting
Jeroen Pluimers
stukelly
