Sorting algorithms/Comb sort: Difference between revisions

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

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

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

say copies('▒', 60) /*display a separator line (a fence). */

call combSort # /*invoke the comb sort. (with # entries)*/

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

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

s=trunc(s*0.8) /*Note: ÷ is slow, * is better. */

if @.j>@.js then do; _=@.j; @.j=@.js; @.js=_; done=0; end

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 entrieselements in @.*/