Sorting algorithms/Comb sort: Difference between revisions

=={{header|BBC BASIC}}==

<lang BBC BASIC>DEF PROC_CombSort11(Size%)

gap%=Size%

REPEAT

IF gap% > 1 THEN

gap%=gap% / 1.3

IF gap%=9 OR gap%=10 gap%=11

ENDIF

I% = 1

Finished%=TRUE

REPEAT

IF data%(I%) > data%(I%+gap%) THEN

SWAP data%(I%),data%(I%+gap%)

Finished% = FALSE

ENDIF

I%+=1

UNTIL I%+gap% > Size%

UNTIL gap%=1 AND Finished%

ENDPROC</lang>

=={{header|COBOL}}==

This excerpt contains just enough of the procedure division to show the workings. See the example for the bubble sort for a more complete program.

<lang COBOL> C-PROCESS SECTION.

C-000.

DISPLAY "SORT STARTING".

MOVE WC-SIZE TO WC-GAP.

PERFORM E-COMB UNTIL WC-GAP = 1 AND FINISHED.

DISPLAY "SORT FINISHED".

C-999.

EXIT.

E-COMB SECTION.

E-000.

IF WC-GAP > 1

DIVIDE WC-GAP BY 1.3 GIVING WC-GAP

IF WC-GAP = 9 OR 10

MOVE 11 TO WC-GAP.

MOVE 1 TO WC-SUB-1.

MOVE "Y" TO WF-FINISHED.

PERFORM F-SCAN UNTIL WC-SUB-1 + WC-GAP > WC-SIZE.

E-999.

EXIT.

F-SCAN SECTION.

F-000.

ADD WC-SUB-1 WC-GAP GIVING WC-SUB-2.

IF WB-ENTRY(WC-SUB-1) > WB-ENTRY(WC-SUB-2)

MOVE WB-ENTRY(WC-SUB-1) TO WC-TEMP

MOVE WB-ENTRY(WC-SUB-2) TO WB-ENTRY(WC-SUB-1)

MOVE WC-TEMP TO WB-ENTRY(WC-SUB-2)

MOVE "N" TO WF-FINISHED.

ADD 1 TO WC-SUB-1.

F-999.

EXIT.</lang>