Anonymous user
Sorting algorithms/Comb sort: Difference between revisions
m
→{{header|REXX}}: added/changed comments and whitespace, used a reduced-sized font for the output.
(Added Rust solution) |
m (→{{header|REXX}}: added/changed comments and whitespace, used a reduced-sized font for the output.) |
||
Line 2,294:
=={{header|REXX}}==
<lang rexx>/*REXX program sorts and displays a stemmed array using the comb sort algorithm. */
call gen
call show
call combSort
call show
exit /*stick a fork in it, we're all done. */
/*──────────────────────────────────────────────────────────────────────────────────────*/
combSort: procedure expose @.; parse arg N /*N: is the number of @ elements. */
g=
return
/*──────────────────────────────────────────────────────────────────────────────────────*/
gen: @.=; @.
@.
@.
@.
@.
@.
@.
@.
@.
@.
@.
do #=1 while @.#\==''; end
#=
/*──────────────────────────────────────────────────────────────────────────────────────*/
show: do k=1 for #; say right('element',15) right(k,w) arg(1)":" @.k; end; return</lang>
Data trivia:
from the Greek word ''hendeka'' [eleven] and ''gon─'' [corner].
{{out|output|:}}
(Shown at three-quarter size.)
<pre style="height:80ex">▼
element 1 before sort: ----polygon--- sides
element 2 before sort: ============== =======
|