Y
Hacker News
new
|
ask
|
show
|
jobs
by
userbinator
4389 days ago
I think heapsort is a better replacement - in-place, guaranteed O(n log n) time (so also quite resistant to information leakage via timing disclosure, which could be important in higher security applications.)