Quick Sort

A highly efficient sorting algorithm that uses a divide-and-conquer approach. It selects a 'pivot' element and partitions the array around it, placing elements smaller than the pivot before it and larger elements after it. This process is recursively applied to sub-arrays until sorted.