pivot

RU: стержень

An element selected from a subarray to drive the partition step in quicksort. After partitioning, the pivot occupies its final sorted position. A pivot that splits the array evenly yields O(log n) recursion depth and O(n log n) total time; a pivot that is always the minimum or maximum degrades to O(n²). Randomized selection makes worst-case degradation unlikely.