September Morn Update

Task/Sorting-algorithms-Bubble-sort/BASIC/sorting-algorithms-bubble-sort-4.basic

@@ -0,0 +1,24 @@
+Dim a(11): ordered=false
+print "Original set"
+For n = 0 to 9
+a[n]=int(rand*20+1)
+print a[n]+", ";
+next n
+#algorithm
+while ordered=false
+   ordered=true
+   For n = 0 to 9
+      if a[n]> a[n+1] then
+          x=a[n]
+          a[n]=a[n+1]
+          a[n+1]=x
+          ordered=false
+       end if
+    next n
+end while
+
+print
+print "Ordered set"
+For n = 1 to 10
+print a[n]+", ";
+next n

Task/Sorting-algorithms-Bubble-sort/BASIC/sorting-algorithms-bubble-sort-5.basic

@@ -0,0 +1,22 @@
+      DIM test(9)
+      test() = 4, 65, 2, -31, 0, 99, 2, 83, 782, 1
+      PROCbubblesort(test(), 10)
+      FOR i% = 0 TO 9
+        PRINT test(i%) ;
+      NEXT
+      PRINT
+      END
+
+      DEF PROCbubblesort(a(), n%)
+      LOCAL i%, l%
+      REPEAT
+        l% = 0
+        FOR i% = 1 TO n%-1
+          IF a(i%-1) > a(i%) THEN
+            SWAP a(i%-1),a(i%)
+            l% = i%
+          ENDIF
+        NEXT
+        n% = l%
+      UNTIL l% = 0
+      ENDPROC

Task/Sorting-algorithms-Bubble-sort/BASIC/sorting-algorithms-bubble-sort-6.basic

@@ -0,0 +1,26 @@
+100 PROGRAM "BubblSrt.bas"
+110 RANDOMIZE
+120 NUMERIC ARRAY(-5 TO 9)
+130 CALL INIT(ARRAY)
+140 CALL WRITE(ARRAY)
+150 CALL BUBBLESORT(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 BUBBLESORT(REF A)
+290   DO
+300     LET CH=0
+310     FOR I=LBOUND(A) TO UBOUND(A)-1
+320       IF A(I)>A(I+1) THEN LET T=A(I):LET A(I)=A(I+1):LET A(I+1)=T:LET CH=1
+330     NEXT
+340   LOOP WHILE CH
+350 END DEF