Cycle Sort

Visualization and “audibilization“ of “Cycle Sort“ algorithm. Sorts a random shuffle of the integers [1,100] using Cycle Sort - The algorithm is an in-place transposition-based sorting algorithm, which always requires only the minimal number of _writes_ to the array. It achieves this by calculating the rank of each element, and swapping it into the correct position. 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