having fun with code

Fibonacci vs. 2n

Written by Eneko Alonso on December 6, 2008 — Leave a Comment

Which sequence of numbers grows faster, Fibonacci or 2n?
It seems like 2n grows faster. It only takes 1025 steps to overflow a Javascript numeric variable, while Fibonacci needs 1477 steps.
Check it out:
http://dev.enekoalonso.com/research/threads-fibonacci-vs-2N.php

Related Posts:

Posted in uncategorized | Tagged , ,

Leave a Reply

You can use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>

Additional comments powered by BackType

«
»

About the blog

This is a blog about development, focused mainly on Javascript but also other languages like python, shell scripts and more.

About the author

Eneko Alonso is a software engineer and UI developer with more than eight years of experience in software and web development. He lives in San Luis Obispo, California and works at LEVEL Studios.

Contact Info

Contact Info

PromoteJS

JavaScript JS Documentation