Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
umanwizard
on Feb 21, 2019
|
parent
|
context
|
favorite
| on:
A Fairly Fast Fibonacci Function
By exactly the same reasoning, every algorithm is O(1) because your computer is a finite object and so the size of the data is bounded.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: