Quick Sort is a highly efficient, in-place sorting algorithm that follows the divide-and-conquer paradigm. It works by selecting a pivot element, partitioning the array so that elements less than the pivot are on its left and greater elements are on its right, and then recursively sorting the subarrays.

Core Steps:

1. Choose a Pivot – Can be the first, last, random, or median element. Random or median-of-three selection often improves performance.

2. Partition the Array – Rearrange elements so smaller ones are before the pivot and larger ones after it.

3. Recursive Calls – Apply the same logic to left and right subarrays until base cases (size ≤ 1) are reached.

Python Implementation (Lomuto Partition):