worst-case performance on sorted or nearly-sorted data. While choosing the first or last element is easier to code, it fails miserably on ordered lists because it splits the array into the most lopsided partitions possible (one side with 0 elements and the other with 1. The Strategy: Why Middle?
Selecting the middle element as the pivot is a strategic choice often used to prevent from hitting its
: For sorted arrays, the middle element is the actual median. Using it ensures the array is split into two equal halves, leading to the ideal performance.
: It handles common real-world data (already sorted, reverse-sorted, or mostly sorted) much better than "naive" first/last pivot choices.
