Module `quicksort`

This module contains a stable quicksort and partition implementation.

Structs

has_direct_interior_mutability
quicksort Sorts v recursively using quicksort. scratch.len() must be at least max(v.len() - v.len() / 2, SMALL_SORT_GENERAL_SCRATCH_LEN) otherwise the implementation may abort.
stable_partition Partitions v using pivot p = v[pivot_pos] and returns the number of elements less than p. The relative order of elements that compare < p and those that compare >= p is preserved - it is a stable partition.