Sorting algorithms/Gnome sort: Difference between revisions
Content added Content deleted
Walterpachl (talk | contribs) m (→version 2: correct output shown) |
m (→version 1: used exact comparisons for literal strings.) |
||
Line 1,669:
gnomeSort: procedure expose @.; parse arg n; k=2 /*n=num items.*/
do j=3 while k<=n; km=k-1 /*KM=prev item*/
if @.km<<=@.k then do; k=j; iterate; end
_=@.km; @.km=@.k; @.k=_ /*swap 2 entries in the @. array.*/
k=k-1; if k==1 then k=j; else j=j-1 /*test index 1*/
| |||