Initial data commit

Task/Sorting-algorithms-Cocktail-sort/IS-BASIC/sorting-algorithms-cocktail-sort.basic

@@ -0,0 +1,27 @@
+100 PROGRAM "CocktSrt.bas"
+110 RANDOMIZE
+120 NUMERIC ARRAY(5 TO 24)
+130 CALL INIT(ARRAY)
+140 CALL WRITE(ARRAY)
+150 CALL COCKTAILSORT(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 COCKTAILSORT(REF A)
+290   LET ST=LBOUND(A)+1:LET EN=UBOUND(A):LET D,CH=1
+300   DO
+310     FOR J=ST TO EN STEP D
+320       IF A(J-1)>A(J) THEN LET T=A(J-1):LET A(J-1)=A(J):LET A(J)=T:LET CH=J
+330     NEXT
+340     LET EN=ST:LET ST=CH-D:LET D=-1*D
+350   LOOP UNTIL EN*D<ST*D
+360 END DEF