Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Sharlin
on July 25, 2024
|
parent
|
context
|
favorite
| on:
My Favorite Algorithm: Linear Time Median Finding ...
It’s unambiguously O(n), there’s no lg n anywhere to be seen. It may be O(n) with a bit larger constant factor, but the whole point of big-O analysis is that those don’t matter.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: