Anonymous user
Sorting algorithms/Gnome sort: Difference between revisions
m
→version 1: put subroutines in alphabetical order, changed a comment.
(Add solution in Factor) |
m (→version 1: put subroutines in alphabetical order, changed a comment.) |
||
Line 2,203:
=={{header|REXX}}==
===version 1===
This REXX version uses
<lang rexx>/*REXX program sorts an array using the gnome sort algorithm (elements contain blanks). */
call gen /*generate the @ stemmed array. */
Line 2,211:
call show ' after sort' /*display the after array elements.*/
exit /*stick a fork in it, we're all done. */
/*──────────────────────────────────────────────────────────────────────────────────────*/▼
gen: @.=; @.1='---the seven virtues---'; @.4="Hope" ; @.7='Justive'
/*──────────────────────────────────────────────────────────────────────────────────────*/
gnomeSort: procedure expose @.; parse arg n; k=2 /*N: is number items. */
Line 2,220 ⟶ 2,225:
return
/*──────────────────────────────────────────────────────────────────────────────────────*/
▲ @.2 = '=======================' ; @.6 = "Fortitude"
▲ @.3 = 'Faith' ; @.7 = "Justice"
@.4 = 'Hope' ; @.8 = "Prudence"▼
@.9 = "Temperance"▼
▲ do #=1 while @.#\==''; end; #=#-1; w=length(#) /*find # of items.*/
return▼
▲/*──────────────────────────────────────────────────────────────────────────────────────*/
show: do j=1 for #; say ' element' right(j,w) arg(1)":" @.j; end; return</lang>▼
'''output'''
<pre>
/*REXX program sorts an array using the gnome sort algorithm (elements contain blanks). */
call gen /*generate the @ stemmed array. */
call show
say copies('▒', 60) /*show a separator line between sorts. */
call gnomeSort # /*invoke the well─known gnome sort. */
call show ' after sort' /*display the after array elements.*/
/*──────────────────────────────────────────────────────────────────────────────────────*/
gen: @.=; @.1='---the seven virtues---'; @.4="Hope" ; @.7='Justive'
@.2='======================='; @.5="Charity [LOVE]"; @.8='Prudence'
do #=1 while @.#\==''; end; #=#-1; w=length(#); return /*find # items.*/
/*──────────────────────────────────────────────────────────────────────────────────────*/
gnomeSort: procedure expose @.; parse arg n; k=2 /*N: is number items. */
do j=3 while k<=n; p=k-1 /*P: is previous item.*/
if @.p<<=@.k then do; k=j; iterate; end /*order is OK so far. */
_=@.p; @.p=@.k; @.k=_ /*swap two @ entries. */
k=k-1; if k==1 then k=j; else j=j-1 /*test for 1st index. */
▲ return
/*──────────────────────────────────────────────────────────────────────────────────────*/
</pre>
| |||