Quick Sort (LR pointers)

Visualization and “audibilization“ of the Quick Sort algorithm. Sorts a random shuffle of the integers [1,100] using the original variant of quick sort, with two pointers (blue) moving from left and right. The middle element is picked as pivot and marked green. The animation is slowed down during the video to give you time to see how the algorithm works. More information on the “Sound of Sorting“ at
Back to Top