Sorting algorithms/Comb sort: Difference between revisions

m
Line 1,174:
290 LET N,GAP=UBOUND(A):LET SW=1
300 DO WHILE GAP>1 OR SW
310 LET GAP=MAX(INT(GAP/1.3),1):LET SW=0
320 LETFOR SWI=0LBOUND(A) TO N-GAP
330 FOR I=LBOUND IF A(I)>A(I+GAP) TO N-GAPTHEN
340 IF LET T=A(I)>:LET A(I)=A(I+GAP):LET THENA(I+GAP)=T
350 LET TSW=A(I):LET A(I)=A(I+GAP):LET A(I+GAP)=T1
360 END LET SW=1IF
370 END IFNEXT
380 NEXTLOOP
390 END LOOPDEF</lang>
400 END DEF</lang>
 
=={{header|J}}==
Anonymous user