Quick Sort (Ternary Split)

Visualization and “audibilization“ of the Ternary Quick Sort algorithm. Sorts a shuffle integers [1,100] using ternary-split quick sort with “equal-less-greater-equal“ partitioning scheme. Two pairs of pointers move from left and right. After joining, the equal elements are swapped to the middle. The pivot is marked green, equal elements are yellow. Since this visualization needs equal keys, the array item distribution is skewed in [1,100] using the quintic x^5 function. More information on the “Sound of Sorting“ at