The bead-sorting algorithm orders a list of a positive integers increasingly by representing numbers as a list of a 1s, where each 1 stands for a bead. The initial integers to be sorted are initially represented as
left-aligned rows of beads, and in each step of the sorting process, a bead is slid
down one unit if possible until each bead can no longer slide. For example, the graphic
above shows the process for the numbers 7, 2, 1, 4, and 2 (Trott 2004, pp. 82-83).
initial integers to be sorted are initially represented as
left-aligned rows of beads, and in each step of the sorting process, a bead is slid
down one unit if possible until each bead can no longer slide. For example, the graphic
above shows the process for the numbers 7, 2, 1, 4, and 2 (Trott 2004, pp. 82-83).
