Re:Gridsort: A stable sort faster than std:sort
by nedoka on Monday February 08, 2021 @06:47AM
(#26063305)
I double checked and it's indeed faster, up to 3x faster if the data is partially sorted.
It uses O(n) aux memory so if std::sort were to use this it would still need IntroSort as a fallback, but that's pretty much a non-issue since std::stablesort already does the same.
It uses O(n) aux memory so if std::sort were to use this it would still need IntroSort as a fallback, but that's pretty much a non-issue since std::stablesort already does the same.