31 lines
1.8 KiB
Rexx
31 lines
1.8 KiB
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 /*some Perrin nums. */
|
|
list=bell bern perrin /*throw 'em───>a pot*/
|
|
say 'original =' list /*an annoucement... */
|
|
size=words(list) /*nice to have SIZE.*/
|
|
do j=1 for size /*build an array, 1 */
|
|
a.j=word(list,j) /*element at a time.*/
|
|
end /*j*/
|
|
call esort size /*sort the stuff. */
|
|
bList=a.1 /*start with 1st. */
|
|
do k=2 to size /*build a list. */
|
|
bList=bList a.k
|
|
end /*k*/
|
|
say ' sorted =' bList /*show & tell time. */
|
|
exit /*stick a fork in it, we're done.*/
|
|
/*──────────────────────────────────ESORT subroutine────────────────────*/
|
|
esort: procedure expose a.; parse arg N; h=N
|
|
do while h>1; h=h%2
|
|
do i=1 for N-h; j=i; k=h+i
|
|
do while a.k<a.j
|
|
parse value a.j a.k with a.k a.j /*swap two elements.*/
|
|
if h>=j then leave; j=j-h; k=k-h
|
|
end /*while a.k<a.j*/
|
|
end /*i*/
|
|
end /*while h>1*/
|
|
return
|