Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
nedoka
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
4 ms
·
1.
▲
by
nedoka
6y ago
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 sin
2.
▲
by
nedoka
6y ago
Similar strategy. Wolfsort is stable however while SpreadSort does not appear to be so. I wonder if wolfsort is stable and faster because it utilizes quadsort? https://github.com/scandum/quadsort