Details
-
New Feature
-
Status: Resolved
-
Major
-
Resolution: Fixed
-
None
Description
Stable sort is desirable in many scenarios. It means equal elements preserve their relative order after sorting.
There are stable sort algorithms. However, in practice, the best sort algorithm is quick sort and quick sort is not stable.
To make the best of both worlds, we support stable sort by stable comparators. It differs from an ordinary comparator in that it breaks ties by comparing the value indices.
With the stable comparator, the quick sort algorithm becomes a stable algorithm.
Attachments
Issue Links
- links to
