Ben Chuanlong Du's Blog

It is never too late to learn.

Sorting Algorithms in Rust

Things on this page are fragmentary and immature notes/thoughts of the author. Please read with your own judgement!


GlideSort is a novel stable sorting algorithm that combines the best-case behavior of Timsort-style merge sorts for pre-sorted data with the best-case behavior of pattern-defeating quicksort for data with many duplicates. It is a comparison-based sort supporting arbitrary comparison operators, and while exceptional on data with patterns it is also very fast for random data.