gen-state-quicksort-and-its-pivot-precisely-and-explain-why-it-m-b6be

State quicksort and its pivot precisely and explain why it matters in 2-3 sentences.

# Quicksort **Algorithm**: Quicksort recursively partitions an array by selecting a **pivot** element, rearranging elements so all values smaller than the pivot are on its left and all larger values on its right, then recursively sorting the left and right subarrays. **Pivot**: An element chosen from the array (commonly the first, last, middle, or a random element) that serves as the comparison reference during partitioning. ## Why the Pivot Matters The pivot choice critically determines quicksort's performance: a good pivot (near the median) splits the array roughly in half, achieving O(n log n) time, while consistently bad pivots (like always picking the minimum/maximum in a sorted array) create unbalanced partitions, degrading to O(n²) worst-case performance. Random or median-of-three pivot selection strategies help avoid pathological cases and maintain expected O(n log n) performance.