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
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.
I do wonder about not enabling inlining structs. I don’t know where the crossover happens, and it certainly varies with hardware characteristics, but I’m sure a data structure made up of say an int and two longs would better be sorted in contiguous memory rather than as an array of pointers to random places in the heap.