A divide-and-conquer algorithm that picks an element as a pivot and partitions the array around the pivot, recursively sorting sub-arrays.
Quick sort is a highly efficient divide-and-conquer sorting algorithm that works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively. It's one of the most popular sorting algorithms due to its excellent average-case performance.