[−][src]Crate timsort
This crate is a stable sorting algorithm with O(n) worst-case storage requirements, O(n log n) worst-case comparisons, and O(n) comparisons on an already-sorted list, smoothly becoming O(n log n) as the sorted sections (runs) get smaller and smaller.
Functions
sort | |
sort_by | |
sort_by_gt | |
try_sort_by | |
try_sort_by_gt | Sorts the list using merge sort. |