Ah, but qsort can be implemented to be O(n log n) in the worst case. The constant factors in this implementation are so bad that nobody does it in practice.
While we're on the soarting boat, it's pretty easy to modify insertion sort to run on O(n log n) time as well.
Slashdot Mirror
Ah, but qsort can be implemented to be O(n log n) in the worst case. The constant factors in this implementation are so bad that nobody does it in practice. While we're on the soarting boat, it's pretty easy to modify insertion sort to run on O(n log n) time as well.