An Introsort variant that tests the input for common structural patterns before each partition, sorted, reverse-sorted, many equal elements, and takes a fast path when structure is detected, otherwise using block partitioning and pivot shuffling.
Pattern detection lets it shortcut work on structured inputs that would cripple standard Quicksort; currently the algorithm behind Rust's slice::sort_unstable and a benchmark reference for unstable sorts.