Quick Sort (LL pointers)

Visualization and “audibilization“ of the Quick Sort algorithm. Sorts a random shuffle of the integers [1,100] using the variant of quick sort in the 3rd edition of CLRS’ textbook, with two pointers (blue) both moving from left. The first element in each recursion range is picked as pivot and marked green (it is immediately moved to the back). 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