Sorting algorithms/Comb sort: Difference between revisions
Content added Content deleted
| Line 1,174: | Line 1,174: | ||
290 LET N,GAP=UBOUND(A):LET SW=1 |
290 LET N,GAP=UBOUND(A):LET SW=1 |
||
300 DO WHILE GAP>1 OR SW |
300 DO WHILE GAP>1 OR SW |
||
310 LET GAP=MAX(INT(GAP/1.3),1) |
310 LET GAP=MAX(INT(GAP/1.3),1):LET SW=0 |
||
320 |
320 FOR I=LBOUND(A) TO N-GAP |
||
330 |
330 IF A(I)>A(I+GAP) THEN |
||
340 |
340 LET T=A(I):LET A(I)=A(I+GAP):LET A(I+GAP)=T |
||
350 LET |
350 LET SW=1 |
||
360 |
360 END IF |
||
370 |
370 NEXT |
||
380 |
380 LOOP |
||
390 |
390 END DEF</lang> |
||
400 END DEF</lang> |
|||
=={{header|J}}== |
=={{header|J}}== |
||