= Bead sort
{wiki=Bead_sort}
Bead sort, also known as gravity sort or bead method, is a non-comparison-based sorting algorithm that operates on the principle of using gravity to arrange elements. It is particularly interesting because it can be visualized as a physical process akin to how beads might slide on a string. \#\#\# How Bead Sort Works: 1. **Representation**: Each number in the input array is represented by a column of beads. The height of each column corresponds to the value of the number it represents.
Back to article page