RosettaCodeData/Task/Sorting-algorithms-Bead-sort/00DESCRIPTION

{{Sorting Algorithm}}

;Task:
Sort an array of positive integers using the [[wp:Bead_sort|Bead Sort Algorithm]].

A &nbsp; ''bead sort'' &nbsp; is also known as a &nbsp; ''gravity sort''.


Algorithm has &nbsp; O(S), &nbsp; where &nbsp; S &nbsp; is the sum of the integers in the input set: &nbsp; 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.
<br><br>
all tasks 2013-04-11 01:07:29 -07:00			`{{Sorting Algorithm}}`

2016 Update 2016-12-05 22:15:40 +01:00			`;Task:`
			`Sort an array of positive integers using the [[wp:Bead_sort\|Bead Sort Algorithm]].`

September 2017 Update 2017-09-23 10:01:46 +02:00			`A   ''bead sort''   is also known as a   ''gravity sort''.`

2016 Update 2016-12-05 22:15:40 +01:00
			`Algorithm has   O(S),   where   S   is the sum of the integers in the input set:   Each bead is moved individually.`

Another update from ingydotnet^djgoku 2015-11-18 06:14:39 +00:00			`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.`
2016 Update 2016-12-05 22:15:40 +01:00			`<br><br>`