Sorting algorithms/Gnome sort: Difference between revisions

<lang rexx>

/*REXX program sorts an array using the gnome-sort method. */

call gen@ /*generate array elements. */

call show@ 'before sort' /*show before array elements*/

call gnomeSort highItem /*invoke the gnome sort. */

call show@ ' after sort' /*show after array elements*/

/*─────────────────────────────────────gnomeSORT subroutine────────*/

gnomeSort: procedure expose @.; parse arg n

k=2

do j=3 while k<=n

km1=k-1

if @.km1<=@.k then k=j

else do

_=@.km1

@.km1=@.k

@.k=_

k=k-1

if k==1 then k=j

end

end

/*─────────────────────────────────────GEN@ subroutine─────────────*/

gen@: @.='' /*assign default value. */

do highItem=1 while @.highItem\=='' /*find how many entries. */

end

highItem=highItem-1 /*adjust highItem slightly. */

return

/*─────────────────────────────────────SHOW@ subroutine────────────*/

show@: widthH=length(highItem) /*maximum width of any line.*/

do j=1 for highItem

say 'element' right(j,widthH) arg(1)":" @.j

end

say copies('─',80) /*show a seperator line. */

</lang>

Output:

<pre style="height:30ex;overflow:scroll">

────────────────────────────────────────────────────────────────────────────────

────────────────────────────────────────────────────────────────────────────────