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

update

Browse source
This commit is contained in:
Ingy döt Net 2013-06-05 21:47:54 +00:00
parent 1f1ad49427
commit 6f050a029e
2496 changed files with 37609 additions and 3031 deletions
Download patch file Download diff file Expand all files Collapse all files

68
Task/Sorting-algorithms-Radix-sort/REXX/sorting-algorithms-radix-sort.rexx
View file

@ -5,62 +5,51 @@ aList='0 2 3 4 5 5 7 6 6 7 11 7 13 9 8 8 17 8 19 9 10 13 23 9 10 15 9 11',
'73 39 13 23 18 18 79 13 12 43 83 14 22 45 32 17 89 13 20 27 34 49',
'24 13 97 16 17 14 101 22 103 19 15 55 107 13 109 18 40 15 113 -42'
/*excluding -42, the abbreviated list is called the integer log function*/
mina=word(aList,1); maxa=mina
do n=1 for words(aList); x=word(aList,n); @.n=x /*list ──► array.*/
mina=min(x,mina); maxa=max(x,maxa)
mina=word(aList,1); maxa=mina
do n=1 for words(aList); x=word(aList,n); @.n=x /*list ──► array.*/
mina =min(x,mina); maxa=max(x,maxa)
width=max(length(abs(mina)),length(maxa))
end
end /*n*/
n=words(aList); w=length(n); call radSort n
do j=1 for n
say 'item' right(j,w) "after the radix sort:" right(@.j,width+1)
do j=1 for n
say 'item' right(j,w) "after the radix sort:" right(@.j,width+1)
end /*j*/
exit /*stick a fork in it, we're done.*/
/*───────────────────────────────────RADSORT subroutine─────────────────*/
radSort: procedure expose @. width; parse arg size; mote=c2d(' '); #=1
!.#._b=1
!.#._i=1
!.#._n=size; do i=1 for size; y=@.i; @.i=right(abs(y),width,0)
if y<0 then @.i='-'@.i
!.#._b=1; !.#._i=1
!.#._n=size; do i=1 for size; y=@.i; @.i=right(abs(y),width,0)
if y<0 then @.i='-'@.i
end /*i*/
/*══════════════════════════════════════where the rubber meets the road.*/
do while #\==0; ctr.=0; L='ffff'x; low=!.#._b; n=!.#._n; radi=!.#._i; H=
#=#-1
do j=low for n; parse var @.j =(radi) _ +1; ctr._=ctr._+1
if ctr._==1 then if _\=='' then do
if _<<L then L=_
if _>>H then H=_
end
do j=low for n; parse var @.j =(radi) _ +1; ctr._=ctr._+1
if ctr._==1 then if _\=='' then do
if _<<L then L=_
if _>>H then H=_
end
end /*j*/
if L>>H then iterate
if L>>H then iterate
_=
if L==H then if ctr._==0 then do; #=#+1; !.#._b=low
!.#._n=n
!.#._i=radi+1; iterate
end
L=c2d(L); H=c2d(H); ?=ctr._+low; top._=?; ts=mote; max=L
do k=L to H; _=d2c(k,1); cen=ctr._
if L==H then if ctr._==0 then do; #=#+1; !.#._b=low
!.#._n=n
!.#._i=radi+1; iterate
end
L=c2d(L); H=c2d(H); ?=ctr._+low; top._=?; ts=mote; max=L
do k=L to H; _=d2c(k,1); cen=ctr._
if cen>ts then parse value cen k with ts max
?=?+cen; top._=?
end /*k*/
pivot=low
do while pivot<low+n; it=@.pivot
do while pivot<low+n; it=@.pivot
do forever
parse var it =(radi) _ +1; cen=top._-1; if pivot>=cen then leave
top._=cen; ?=@.cen; @.cen=it; it=?
end /*forever*/
top._=pivot; @.pivot=it; pivot=pivot+ctr._
top._=pivot; @.pivot=it; pivot=pivot+ctr._
end /*while pivot<low+n*/
i=max
do until i==max; _=d2c(i,1); i=i+1; if i>H then i=L; d=ctr._
if d<=mote then do; if d>1 then call .radSortP top._,d; iterate; end
#=#+1; !.#._b=top._
@ -69,13 +58,14 @@ radSort: procedure expose @. width; parse arg size; mote=c2d(' '); #=1
end /*until i==max*/
end /*while #\==0 */
/*═════════════════════════════════════we're done with the heavy lifting*/
do i=1 for size; @.i=@.i+0; end /*i*/
#=0; do i=size by -1 to 1; if @.i>=0 then iterate; #=#+1; @@.#=@.i; end
do j=1 for size; if @.j <0 then iterate; #=#+1; @@.#=@.j; end
do k=1 for size; @.k=@@.k+0; end /*combine neg&pos radix lists*/
return
/*───────────────────────────────────.radSortP subroutine───────────────*/
.radSortP: parse arg bbb,nnn
do k=bbb+1 for nnn-1; q=@.k
.radSortP: parse arg bbb,nnn
do k=bbb+1 for nnn-1; q=@.k
do j=k-1 by -1 to bbb while q<<@.j; jp=j+1; @.jp=@.j; end
jp=j+1; @.jp=q
jp=j+1; @.jp=q
end /*k*/
return