News for hackers. Stuff that matters.
Re:Algorithmic complexity attacks and libc qsort() by userbinator on Wednesday June 11, 2014 @09:36PM (#7881390)
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.)

There are no comments on this comment yet.