Quick Sort

Quick Sort is a highly efficient divide-and-conquer sorting algorithm. It works by selecting a 'pivot' element and partitioning the array into elements less than the pivot and elements greater than the pivot, then recursively sorting the partitions.