News for hackers. Stuff that matters.

A comment on Changing std:sort at Google’s scale and beyond. Parent comment

Re:Changing std:sort at Google’s scale and beyond by dralley on Wednesday April 20, 2022 @02:45PM (#31101208)
IIRC Rust and Swift have a modified timsort implementation to remove the "galloping" strategy.
[ Parent | on HN ]
Re:Changing std:sort at Google’s scale and beyond by tialaramex on Wednesday April 20, 2022 @03:58PM (#31102149)
Rust has "an adaptive, iterative merge sort inspired by timsort" to implement the stable sort() method if you have an allocator, and a pattern-defeating quicksort to implement unstable_sort() which is provided even if you don't have an allocator (no_std embedded environments).
[ Parent | on HN ]