Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
jiggawatts
on July 27, 2024
|
parent
|
context
|
favorite
| on:
My Favorite Algorithm: Linear Time Median Finding ...
I think you meant 2N+2M vs 2N+M, but yes, that’s the point: not reading twice is cheaper because unlike in traditional big-O analysis compute is cheap but data access is very expensive.
srcreigh
on July 28, 2024
[–]
Yep, thx.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: