Blitsort is an in-place stable adaptive rotate merge sort

Re:Blitsort is an in-place stable adaptive rotate merge sort by mlochbaum on Saturday July 10, 2021 @02:18PM (#27795326)

I guess that makes sense, but I never would have guessed that the category is in-place stable algorithms as it's only mentioned in the "about" line and not the text itself.

Sorting on an integer key isn't the same as sorting a list of integers. They have different performance considerations.

[ Parent | on HN ]

Re:Blitsort is an in-place stable adaptive rotate merge sort by scandum on Monday July 12, 2021 @06:55PM (#27816039)

I updated the README slightly, it's mentioned twice now. :)

As for performance considerations, blitsort's performance on integers is indicative of its performance on strings, while this isn't the case for pdqsort.

I haven't ran a specific benchmark, but I assume that on string data blitsort will beat pdqsort for every metric except random with many equal items.

[ Parent | on HN ]