Quicksort

An efficient sorting algorithm invented by Tony Hoare that employs a divide-and-conquer strategy. It selects a pivot element to partition an array into two sub-arrays, which are then sorted recursively. The average time complexity is O(n log n), and the algorithm requires minimal additional memory.