News for hackers. Stuff that matters.

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

Re:Blitsort is an in-place stable adaptive rotate merge sort by kzrdude on Saturday July 10, 2021 @09:51AM (#27793360)
It's using a qsort-like interface using a function pointer for the comparison - surely a C++ like implementation has a lot to gain here?
[ Parent | on HN ]
Re:Blitsort is an in-place stable adaptive rotate merge sort by scandum on Saturday July 10, 2021 @05:17PM (#27796532)
Correct, if you uncomment

  //#define cmp(a,b) (*(a) > *(b))
in blitsort.h it'll run about 25% faster. Probably still slower than a native C++ implementation since it'll evaluate to (a > b) > 0 rather than (a > b), not sure if the compiler will optimize that.
[ Parent | on HN ]