News for hackers. Stuff that matters.

A comment on Blitsort is an in-place stable adaptive rotate merge sort. Parent comment

Re:Blitsort is an in-place stable adaptive rotate merge sort by lpapez on Saturday July 10, 2021 @11:40AM (#27794137)
Exactly. It has the same limitations as a radix sort, which is why I find them comparable
[ Parent | on HN ]
Re:Blitsort is an in-place stable adaptive rotate merge sort by bradleyjg on Saturday July 10, 2021 @11:45AM (#27794179)
For a radix sort it’s impossible to sort linked data structures, at least as I understand it.

Whereas any comparison based sort can follow the pointers and do arbitrary comparisons.

[ Parent | on HN ]