algorithmic complexity attacks and libc qsort()

[Thomas Klausner <tk%giga.or.at@localhost>]

Analysis of worst cases for libc's qsort() on various operating
systems, including NetBSD:

http://calmerthanyouare.org/2014/06/11/algorithmic-complexity-attacks-and-libc-qsort.html

I don't think there's much to do here, really, since we know that
qsort has a n^2 worst case :)

Except if we want to improve it based on FreeBSD's version, that
switched to insertion sort in some cases and improves the best case
this way.
 Thomas