
Sorting Algorithm

This is a sorting algorithm.   It may be applied to a set of data in order to sort it.    
For comparing various sorts, see compare sorts.  
For other sorting algorithms,   see sorting algorithms,   or:

O(n logn) sorts
Heap sort |
Merge sort |
Patience sort |
Quick sort
O(n log2n) sorts
Shell Sort
O(n2) sorts
Bubble sort |
Cocktail sort |
Cocktail sort with shifting bounds |
Comb sort |
Cycle sort |
Gnome sort |
Insertion sort |
Selection sort |
Strand sort
other sorts
Bead sort |
Bogo sort |
Common sorted list |
Composite structures sort |
Custom comparator sort |
Counting sort |
Disjoint sublist sort |
External sort |
Jort sort |
Lexicographical sort |
Natural sorting |
Order by pair comparisons |
Order disjoint list items |
Order two numerical lists |
Object identifier (OID) sort |
Pancake sort |
Quickselect |
Permutation sort |
Radix sort |
Ranking methods |
Remove duplicate elements |
Sleep sort |
Stooge sort |
[Sort letters of a string] |
Three variable sort |
Topological sort |
Tree sort


Task

Sort an array of positive integers using the 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.




get "libhdr"
 
let max(A, len) = valof
$(  let x = 0
    for i=0 to len-1
        if x<A!i do x := A!i
    resultis x
$)
 
let beadsort(A, len) be
$(  let size = max(A, len)
    let tvec = getvec(size-1)
    for i=0 to size-1 do tvec!i := 0
    for i=0 to len-1
        for j=0 to A!i-1 do tvec!j := tvec!j + 1
    for i=len-1 to 0 by -1
    $(  let n = 0
        for j=0 to size-1 
            if tvec!j > 0 
            $(  tvec!j := tvec!j - 1
                n := n + 1
            $)
        A!i := n
    $)
    freevec(tvec)
$)
 
let write(s, A, len) be
$(  writes(s)
    for i=0 to len-1 do writed(A!i, 4)
    wrch('*N')
$)
 
let start() be
$(  let array = table 10,1,5,5,9,2,20,6,8,4
    let length = 10    
    write("Before: ", array, length)
    beadsort(array, length)
    write("After:  ", array, length)
$)