Anonymous user
Sort an integer array: Difference between revisions
m
→sort a list: changed comments and indentations, removed STYLE from the PRE html tag, changed right arrow glyph.
m (→sort an array: added/changed whitespace, used a sparse array, eliminated zero-valued array elements.) |
m (→sort a list: changed comments and indentations, removed STYLE from the PRE html tag, changed right arrow glyph.) |
||
Line 1,332:
<br>sorted, than the list is re-constituted.
<lang rexx>/*REXX program sorts (using E-sort) a list of some interesting integers.*/
▲ /*quotes aren't needed if all elements in a list are non-negative.*/
bell= 1 1 2 5 15 52 203 877 4140 21147 115975 /*some Bell numbers.*/
bern= '1 -1 1 0 -1 0 1 0 -1 0 5 0 -691 0 7 0 -3617' /*some Bernoulli num*/
perrin= 3 0 2 3 2 5 5 7 10 12 17 22 29 39 51 68 90
list=bell bern perrin /*throw '
say '
size=words(list) /*nice to have SIZE.*/
do j=1 for size
end /*j*/
call esort size /*sort the stuff. */
bList=
do k=
bList=strip(bList
end /*k*/
say ' sorted =' bList /*show & tell time. */
exit /*stick a fork in it, we're done.*/
/*──────────────────────────────────ESORT subroutine────────────────────*/
esort: procedure expose
do while h>1; h=h%2 /*partition array. */
do i=1 for N-h; j=i; k=h+i
do while
parse value
if h>=j then leave; j=j-h; k=k-h
end /*while
end /*i*/
end /*while h>1*/
return</lang>
'''output'''
<pre>
original = 1 1 2 5 15 52 203 877 4140 21147 115975 1 -1 1 0 -1 0 1 0 -1 0 5 0 -691 0 7 0 -3617 3 0 2 3 2 5 5 7 10 12 17 22 29 39 51 68 90
sorted = -3617 -691 -1 -1 -1 0 0 0 0 0 0 0 0 1 1 1 1 1 2 2 2 3 3 5 5 5 5 7 7 10 12 15 17 22 29 39 51 52 68 90 203 877 4140 21147 115975
| |||