Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
bo1024
on July 25, 2024
|
parent
|
context
|
favorite
| on:
My Favorite Algorithm: Linear Time Median Finding ...
You're already using your own randomness to pick the pivot at random, so I don't see why the shuffle helps more. But yes, if your randomness is trustworthy, the probability of more than O(n) runtime is very low.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: