Quick Sort

Tony Hoare, 1959

Developed by Tony Hoare in 1959 while working on machine translation, quicksort is one of the most widely used sorting algorithms. It picks a pivot, partitions the array around it, and recursively sorts both sides. Its average O(n log n) performance and in-place operation make it the default choice in many standard libraries. The visualization highlights the pivot in coral, the current comparison in gold, and settled positions in teal.