Initial data commit

Task/Sorting-algorithms-Comb-sort/IS-BASIC/sorting-algorithms-comb-sort.basic

@@ -0,0 +1,30 @@
+100 PROGRAM "CombSrt.bas"
+110 RANDOMIZE
+120 NUMERIC ARRAY(11 TO 30)
+130 CALL INIT(ARRAY)
+140 CALL WRITE(ARRAY)
+150 CALL COMBSORT(ARRAY)
+160 CALL WRITE(ARRAY)
+170 DEF INIT(REF A)
+180   FOR I=LBOUND(A) TO UBOUND(A)
+190     LET A(I)=RND(98)+1
+200   NEXT
+210 END DEF
+220 DEF WRITE(REF A)
+230   FOR I=LBOUND(A) TO UBOUND(A)
+240     PRINT A(I);
+250   NEXT
+260   PRINT
+270 END DEF
+280 DEF COMBSORT(REF A)
+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     FOR I=LBOUND(A) TO N-GAP
+330       IF A(I)>A(I+GAP) THEN
+340         LET T=A(I):LET A(I)=A(I+GAP):LET A(I+GAP)=T
+350         LET SW=1
+360       END IF
+370     NEXT
+380   LOOP
+390 END DEF