Sorting algorithms/Bead sort

Sort an array of positive integers using the Bead Sort Algorithm.

A bead sort is also known as a gravity sort.

The algorithm has O(S), where S is the sum of the integers in the input set: Each bead is moved individually.

This is the case when bead sort is implemented without a mechanism to assist in finding empty spaces below the beads, such as in software implementations.

Test

Boilerplate code

Console output

Shortcuts on this page

Use Cmd instead of Ctrl if you're on a Mac.

`g`	Focus editor
`Ctrl`-`Enter`	Run the test with current code
`Ctrl`-`Shift`-`K`	Reset the editor
`Ctrl`-`Shift`-`L`	Clear console output
`Ctrl`-`Shift`-`X`	Show the solution
`[`	Previous challenge
`]`	Next challenge
`T`	Back to top page
`?`	Show this dialog
`ESC`	Hide this dialog
`Shift`-`ESC`	Blur focus from editor