This algorithm is really fast... Like... REALLY fast... It is a tiny bit slower the heapsort O(n * sqrt(n)) In addition, it is faster on already sorted lists, making it more effective W to double sample size, S to half it
Its my sorting algorithm, but the visualizer was inspired by MathMathMath's "The Sound of Sorting"
