Fibonacci without Recursion

Andy talks about Fibonacci sequences:

"Honestly though aside from the beauty of the sequence what practical purpose does calculating the sequence serve? Anybody out there have an answer to that other than "it a good way to show/test recursion"? I'll give public props to the first commentor who gives me one real-world practical use for calculating the sequence."

To begin -- go get Fibonacci without recursion via the simple function like:

function fun1(n)
{ 
   var f;
   var j; 
   f = (1 + Math.pow(5, 0.5)) / 2;
   g = 1 - f; 
   return (Math.pow(f,(n + 1)) - Math.pow(g,(n + 1))) / Math.pow(5, 0.5);
}

Real world examples usually come from the building industry. Like, er, you have 0 and 00 blocks to accomplish 1*N road/wall, etc. You have to calculate how. Besides, fibonacci problem is always a good interview question.

Related Posts:

• LiveMessage Alerts
• On CC'ing Emails Practices
• Firefox on Steroids: Play safe, Play fair
• Received feedback from Bill's House O Insomnia
• MCP Hall of Fame
• My 2 cents on Hailstorm
• Minimo based on Gecko
• TechedBloggers.Net 2005 starts to roll
• Firefox update
• t-sql and asp.net

Awesome! I never would have thought of the building a wall, pricing materials angle. Very cool! Now that I see it has a practicle use I can definitely see why it would make a good interview question.

I think your example is missing some variable declarations. IE where does l come from?

Never mind I just re-read the function and it's a 1 not an l so now it makes sense to me.

just made it via javascript