Merge Sort

Visualization and “audibilization“ of the Merge Sort algorithm. Sorts a random shuffle of the integers [1,100] using merge sort. The left and right boundary of each range is marked with green, the middle with blue. This merge sort does not work in-place, when merging sorted ranges it writes to a shadow array, which is copied back after the merge. Only comparisons are used to generate sound, thus the copy is silent. More information on the “Sound of Sorting“ at