29 lines
2.3 KiB
Rexx
29 lines
2.3 KiB
Rexx
/*REXX program sorts (using E─sort) and displays a list of some interesting integers. */
|
|
Bell= 1 1 2 5 15 52 203 877 4140 21147 115975 /*a few Bell " */
|
|
Bern= '1 -1 1 0 -1 0 1 0 -1 0 5 0 -691 0 7 0 -3617' /*" " Bernoulli " */
|
|
Perrin= 3 0 2 3 2 5 5 7 10 12 17 22 29 39 51 68 90 /*" " Perrin " */
|
|
list=Bell Bern Perrin /*throw them all ───► a pot. */
|
|
say 'unsorted =' list /*display what's being shown.*/
|
|
size=words(list) /*nice to have # of elements.*/
|
|
do j=1 for size /*build an array, a single */
|
|
@.j=word(list,j) /* ··· element at a time.*/
|
|
end /*j*/
|
|
call eSort size /*sort the collection of #s. */
|
|
$= /*list: define as null so far*/
|
|
do k=1 for size /*build a list from the array*/
|
|
$=$ @.k /*append a number to the list*/
|
|
end /*k*/
|
|
say ' sorted =' space($) /*display the sorted list. */
|
|
exit /*stick a fork in it, we're all done.*/
|
|
/*──────────────────────────────────────────────────────────────────────────────────────*/
|
|
eSort: procedure expose @.; parse arg N; h=N /*get item count for array. */
|
|
do while h>1; h=h%2 /*partition the array. */
|
|
do i=1 for N-h; j=i; k=h+i
|
|
do while @.k<@.j /*keep swapping while less. */
|
|
parse value @.j @.k with @.k @.j /*swap two array elements. */
|
|
if h>=j then leave; j=j-h; k=k-h
|
|
end /*while @.k<@.j*/
|
|
end /*i*/
|
|
end /*while h>1*/
|
|
return
|