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

Initial data commit

Browse source
This commit is contained in:
Ingy döt Net 2023-07-01 11:58:00 -04:00
parent 72d218235f
commit f23f22d71c
199087 changed files with 3378941 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

13
Task/Sorting-algorithms-Bead-sort/00-TASK.txt Normal file
View file

@ -0,0 +1,13 @@
{{Sorting Algorithm}}
;Task:
Sort an array of positive integers using the [[wp:Bead_sort|Bead Sort Algorithm]].
A   ''bead sort''   is also known as a   ''gravity sort''.
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.
<br><br>