Sorting algorithms/Comb sort: Difference between revisions
Content added Content deleted
No edit summary |
(GP) |
||
| Line 832: | Line 832: | ||
{CombSort Arr} |
{CombSort Arr} |
||
{Show {Array.toRecord unit Arr}}</lang> |
{Show {Array.toRecord unit Arr}}</lang> |
||
=={{header|PARI/GP}}== |
|||
<lang parigp>combSort(v)={ |
|||
my(phi=(1+sqrt(5))/2,magic=1/(1-exp(-phi)),g=#v,swaps); |
|||
while(g>1 | swaps, |
|||
if(g>1, g\=magic); |
|||
swaps=0; |
|||
for(i=1,#v-g, |
|||
if(v[i]>v[i+g], |
|||
my(t=v[i]); |
|||
v[i]=v[i+g]; |
|||
v[i+g]=t; |
|||
swaps++ |
|||
) |
|||
) |
|||
); |
|||
v |
|||
};</lang> |
|||
=={{header|Perl}}== |
=={{header|Perl}}== |
||
<lang perl>sub combSort { |
<lang perl>sub combSort { |
||