Forums
New posts
Search forums
Members
Current visitors
Log in
Register
What's new
Search
Search
Search titles only
By:
New posts
Search forums
Menu
Log in
Register
Install the app
Install
Forums
Archive
Archive
C Programming
fibinocci series
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
Reply to thread
Message
[QUOTE="Dik T. Winter, post: 2433773"] No, you get O(1) when you calculate a single fibonacci number the fastest way: for n >= 0: round(pow((sqrt(5) + 1)/2, n) / sqrt(5))). [/QUOTE]
Verification
Post reply
Forums
Archive
Archive
C Programming
fibinocci series
Top
