News for hackers. Stuff that matters.
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.

Re:Gridsort: A stable sort faster than std:sort by richardwhiuk on Tuesday February 09, 2021 @01:57PM (#26081235)
How can stablesort use IntroSort if IntroSort is non-stable?
Re:Gridsort: A stable sort faster than std:sort by jsnell on Tuesday February 09, 2021 @02:07PM (#26081315)
They mean that std::stable_sort already needs an extra memory buffer, and falls back to a different algorithm if that can't be allocated.