Suppose you drop a set of drums and they land randomly ordered in a row on the floor. You want to put the drums back in order but can only pick up and swap two at a time. A not so good strategy to minimize the number of swaps you must make is to follow the insertion sort algorithm http://en.wikipedia.org/wiki/Insertion_sort
If you order the drums by their general MIDI number and simultaneously strike any two which you swap then you will produce a sound similar to this.
Note that may of the drums have the same MIDI number and thus appear at the same height in the graph. When you swap drums at the same MIDI number the graph will look the same but sound is still produced.
Link to this comment:
All Comments (0)