Hacker News new | ask | show | jobs
by hamandcheese 3403 days ago
O(1) might not either :)
2 comments

Because you might be dead already. Which would be a weird edge case.
No. O(1) just means the algorithm always takes no more than some arbitrary, but fixed amount of time to complete, regardless of the size of the input. That fixed amount of time could be a billion years (or more).
It consistently takes a billion years, it's O(1).