quicksort

RU: быстрая сортировка

A divide-and-conquer sorting algorithm that picks a pivot, partitions the array into elements less than and greater than the pivot, then recursively sorts each part. Average-case time is O(n log n); worst case is O(n²) when the pivot is always the minimum or maximum, which randomized pivot selection makes unlikely in practice.