Sorting algorithms/Comb sort: Difference between revisions

Programming note: &nbsp; the REXX statement (line 11) &nbsp; &nbsp; <big> '''s=trunc(s*.8)''' </big> &nbsp; &nbsp; could've been expressed as: &nbsp; &nbsp; <big> '''s=s*.8%1''' </big> &nbsp; &nbsp; (which is slower), but is more cryptic.

<lang rexx>/*REXX program sorts a stemmed array using the comb-sort algorithm. */

call gen@; w=length(#) /*generate the array elements. */

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

call combSort # /*invoke the comb sort. */

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

exit /*stick a fork in it, we're done.*/

/*──────────────────────────────────COMBSORT subroutine─────────────────*/

combSort: procedure expose @.; parse arg N /*N: is number of elements.*/

s=N-1 /*S: is the spread between COMBs.*/

do until s<=1 & done; done=1 /*assume sort is done (so far). */

s=trunc(s*.8) /* ÷ is slow, * is better.*/

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

gen@: @. = ; @.12 = 'dodecagon 12'

@.1 = '----polygon--- sides' ; @.13 = 'tridecagon 13'

@.2 = '============== =======' ; @.14 = 'tetradecagon 14'

@.3 = 'triangle 3' ; @.15 = 'pentadecagon 15'

@.4 = 'quadrilateral 4' ; @.16 = 'hexadecagon 16'

@.5 = 'pentagon 5' ; @.17 = 'heptadecagon 17'

@.6 = 'hexagon 6' ; @.18 = 'octadecagon 18'

@.7 = 'heptagon 7' ; @.19 = 'enneadecagon 19'

@.8 = 'octagon 8' ; @.20 = 'icosagon 20'

@.9 = 'nonagon 9' ; @.21 = 'hectogon 100'

@.10 = 'decagon 10' ; @.22 = 'chiliagon 1000'

@.11 = 'hendecagon 11' ; @.23 = 'myriagon 10000'

do #=1 while @.#\==''; end; #=#-1 /*find how many entries in array.*/

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

show@: say copies('▒',60); do j=1 for # /*display array elements.*/

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

end /*j*/

return</lang>

&nbsp; or &nbsp; ''unidecagon'') &nbsp; is from the Greek word &nbsp;

▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒