Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
userbinator
on June 12, 2014
|
parent
|
context
|
favorite
| on:
Algorithmic complexity attacks and libc qsort()
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.)
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: