jkabrg

11 ms·

1. 91.▲
   by jkabrg 9y ago

   > pdqsort is a hybrid sort; when it encounters apparently pathological input, it switches from a strategy resembling quicksort to heapsort—it doesn't share quicksort's worst case characteristics. I understand how hybrid sorts w
2. 92.▲
   by jkabrg 9y ago

   Thanks for your reply. > Your logic also would mean that any sorting function that is publicly facing (which is basically any interface on the internet, like a sorted list of Facebook friends) would need to use heapsort (which is 2-4 tim
3. 93.▲
   by jkabrg 9y ago

   [Post-edit] I made several edits to the post below. First, to make an argument. Second, to add paragraphs. [/Post-edit] Tl;dr version: It seems to me you should either use heapsort or plain quicksort; the latter with the sort of opti