aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

update meta data

Browse source
This commit is contained in:
Ingy döt Net 2013-04-11 12:07:39 -07:00
parent f3a896c724
commit 90e15ed6ce
3307 changed files with 1674 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

4
Task/Sorting-algorithms-Bead-sort/00DESCRIPTION Normal file
View file

@ -0,0 +1,4 @@
{{Sorting Algorithm}}
In this task, the goal is to sort an array of positive integers using the [[wp:Bead_sort|Bead Sort Algorithm]].
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.