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
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 ]
There are no comments on this comment yet.