There are many sort algorithms in existance. The simplest but slowest is you have all your values in an array and you know the count of the array.
swap = true
while swap is true
swap = false
for index = 0 to cnt-1 step 1
if ary[index] > ary[index+1] then
tmp = ary[index]
ary[index]=ary[index+1]
ary[index+1] = ary[index]
swap = true
endif
endfor
endwhile
This one is very inefficient but will do the job. In essence the outer loop will loop forever until no swaps occur in the inner loop. This is know as a bubble sort as the numbers bubble along into their correct positions.
I strongly recommend you read up on sorting. Knuth has a great book on the subject containg pseudo code. His books are well worth having a prominent place in your bookcase.
[45][ 3][21][11][2]
3 45 21 11 2
3 21 45 11 2
3 21 11 45 2
3 21 11 45 2
next outer loop without the little steps
3 11 21 2 45
3 11 2 21 45
3 2 11 21 45
2 3 11 21 45
Last edited by wildgoose; Jul 6th, 2009 at 11:23 am. Reason: adjustment
Reputation Points: 546
Solved Threads: 99
Practically a Posting Shark
Offline 891 posts
since Jun 2009
Unsolved 
