Sorting algorithms are fundamental to computer science. The most widely used general-purpose sorting algorithm is Quicksort, discovered in 1962.
Quicksort works by selecting a pivot element and partitioning the array around it. Elements smaller than the pivot move left; elements larger move right. The process then recurses on both partitions.
The expected time complexity of Quicksort is O(n log n), which makes it extremely fast in practice despite its worst-case O(n²) behavior.