aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Just another update

Browse source
This commit is contained in:
Ingy döt Net 2015-02-20 00:35:01 -05:00
parent a25938f123
commit 00a190b0a6
6591 changed files with 94363 additions and 23227 deletions
Download patch file Download diff file Expand all files Collapse all files

77
Task/Sorting-algorithms-Pancake-sort/REXX/sorting-algorithms-pancake-sort.rexx
View file

@ -1,59 +1,38 @@
/*REXX program sorts/shows an array using the pancake sort algorithm.*/
/*REXX program sorts & shows an array using the pancake sort algorithm.*/
call gen@ /*generate elements in the array.*/
call show@ 'before sort' /*show the BEFORE array elements.*/
call pancakeSort #items /*invoke the pancake sort. Yummy.*/
call pancakeSort # /*invoke the pancake sort. Yummy.*/
call show@ ' after sort' /*show the AFTER array elements.*/
exit /*stick a fork in it, we're done.*/
/*──────────────────────────────────PANCAKESORT subroutine──────────────*/
pancakeSort: procedure expose @.; parse arg n
do n-1 /*perform this loop N-1 times.*/
!=@.1; ?=1
do j=2 to n
if @.j<=! then iterate
!=@.j; ?=j
end /*j*/
call flip ?; call flip n
n=n-1
end /*n-1*/
return
/*──────────────────────────────────FLIP subroutine─────────────────────*/
flip: procedure expose @.; parse arg w
do i=1 for (w+1)%2 /*In REXX, % is integer divide.*/
kmip1=w-i+1; _=@.i; @.i=@.kmip1; @.kmip1=_
end /*i*/
flip: procedure expose @.; parse arg y
do i=1 for (y+1)%2
ymp=y-i+1; _=@.i; @.i=@.ymp; @.ymp=_
end /*i*/
return
/*──────────────────────────────────GEN@ subroutine─────────────────────*/
gen@: @.='' /*assign a default value. */
/*Generate some bread primes which are primes of the*/
/*form: (p-3)÷2 and 2∙p+3 where p is a prime.*/
/*Bread primes are related to sandwich & meat primes.*/
/*──────────────────────────────────GEN@ subroutine──────────────────────────────────────────────────────────────────*/
gen@: /*a few sorted bread primes which are primes of the form: (p-3)÷2 and 2∙p+3 */
/*where p is a prime. Bread primes are related to sandwich and meat primes. */
bp=2 17 5 29 7 37 13 61 43 181 47 197 67 277 97 397 113 461 137 557 167 677 173 701 797 1117 307 1237 1597 463 1861 467
fb='-55 -21 -1 -8 -8 -21 -55 0 0' /*some non-positive Fibonacci #s,*/
$=bp fb /* most of which are repeated.*/
#=words($) /*get number of items in $ list. */
/* [↓] populate @ array with #s.*/
do j=1 for #; @.j=word($,j); end /*obtain a number of the $ list.*/
return
/*──────────────────────────────────PANCAKESORT subroutine──────────────*/
pancakeSort: procedure expose @.; parse arg N
@.1= 2 ; @.17= 113 ; @.33= -55
@.2= 17 ; @.18= 461 ; @.34= -21
@.3= 5 ; @.19= 137 ; @.35= -1
@.4= 29 ; @.20= 557 ; @.36= -8
@.5= 7 ; @.21= 167 ; @.37= -8
@.6= 37 ; @.22= 677 ; @.38= -21
@.7= 13 ; @.23= 173 ; @.39= -55
@.8= 61 ; @.24= 701 ; @.40= 0
@.9= 43 ; @.25= 797 ; @.41= 0
@.10= 181 ; @.26= 1117
@.11= 47 ; @.27= 307 /*The non-positive numbers*/
@.12= 197 ; @.28= 1237 /*above are some negative */
@.13= 67 ; @.29= 1597 /*Fibonacci numbers, some */
@.14= 277 ; @.30= 463 /*of which where specified*/
@.15= 97 ; @.31= 1861 /*twice just 'cause I felt*/
@.16= 397 ; @.32= 467 /*like it. Also, added */
/*two zeroes, just 'cause.*/
do #items=1 while @.#items\==''; end /*find how many entries in array.*/
#items=#items-1 /*adjust the #items slightly. */
do N=N by -1 for N-1
!=@.1; ?=1; do j=2 to N; if @.j<=! then iterate
!=@.j; ?=j
end /*j*/
call flip ?; call flip N
end /*N*/
return
/*──────────────────────────────────SHOW@ subroutine────────────────────*/
show@: widthH=length(#items) /*the maximum width of any line. */
do k=1 for #items
say 'element' right(k,widthH) arg(1)':' @.k
end /*k*/
say copies('─',79) /*show an eyeball separator line.*/
show@: w=length(#); do k=1 for #
say ' element' right(k,w) arg(1)':' right(@.k,9)
end /*k*/
say copies('█',40) /*show an eyeball separator line.*/
return