sorting, O(n^2) and O(n log(n))

[Jonas Walld�n @ Pike developers forum]

Though Grubba's commit message didn't reveal so the change is only
related to dmalloc. And speaking of algorithms, check out Introsort
which is a O(n lg n) hybrid of quicksort and heapsort (already used
elsewhere in Pike if I remember correctly).