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.

[lpsp]

This is the curve used for damage falloff in TF2

[GyroCoder]

@James Yakura because this algorithm is specialized to be clever enough to handle duplicate elements in the array efficiently.

[RoyalBlueberry]

i wonder what sorting algorithm our brains use..

[jyn]

Why are you using a different dataset for this one?

[RoddyDev]

What's the real point of sorting?

[douwevandermaden]

sounds like the intro of the album Madvillainy by MF DOOM and Madlib

[tylerandari]

Hold up…
Why are there 40 ones with the same length?

[MetallicMutalisk]

first 10 seconds really reminds me of the original zelda

[WhizzYT]

Squidward: My jazz on the clarinet is good!

Squidward’s *jazz* :

[groszak]

Why do you hide the equal items behind smaller and greater, instead of in front?

[LudwigvanBeethoven]

Ending spunded like sonic getting coins

[deleteduser]

what kind of shit, the sounds of prayers