Initial data commit

Task/Sorting-algorithms-Insertion-sort/COBOL/sorting-algorithms-insertion-sort-1.cobol

@@ -0,0 +1,27 @@
+       C-PROCESS SECTION.
+           PERFORM E-INSERTION VARYING WB-IX-1 FROM 1 BY 1
+                               UNTIL WB-IX-1 > WC-SIZE.
+
+...
+
+       E-INSERTION SECTION.
+       E-000.
+           MOVE WB-ENTRY(WB-IX-1) TO WC-TEMP.
+           SET WB-IX-2 TO WB-IX-1.
+
+           PERFORM F-PASS UNTIL WB-IX-2 NOT > 1 OR
+                                WC-TEMP NOT < WB-ENTRY(WB-IX-2 - 1).
+
+           IF WB-IX-1 NOT = WB-IX-2
+              MOVE WC-TEMP TO WB-ENTRY(WB-IX-2).
+
+       E-999.
+           EXIT.
+
+       F-PASS SECTION.
+       F-000.
+           MOVE WB-ENTRY(WB-IX-2 - 1) TO WB-ENTRY(WB-IX-2).
+           SET WB-IX-2                DOWN BY 1.
+
+       F-999.
+           EXIT.

Task/Sorting-algorithms-Insertion-sort/COBOL/sorting-algorithms-insertion-sort-2.cobol

@@ -0,0 +1,70 @@
+        >>SOURCE FORMAT FREE
+*> This code is dedicated to the public domain
+*> This is GNUCOBOL 2.0
+identification division.
+program-id. insertionsort.
+environment division.
+configuration section.
+repository. function all intrinsic.
+data division.
+working-storage section.
+01  filler.
+    03  a pic 99.
+    03  a-lim pic 99 value 10.
+    03  array occurs 10 pic 99.
+
+01  filler.
+    03  s pic 99.
+    03  o pic 99.
+    03  o1 pic 99.
+    03  sorted-len pic 99.
+    03  sorted-lim pic 99 value 10.
+    03  sorted-array occurs 10 pic 99.
+
+procedure division.
+start-insertionsort.
+
+    *> fill the array
+    compute a = random(seconds-past-midnight)
+    perform varying a from 1 by 1 until a > a-lim
+        compute array(a) = random() * 100
+    end-perform
+
+    *> display the array
+    perform varying a from 1 by 1 until a > a-lim
+        display space array(a) with no advancing
+    end-perform
+    display  space 'initial array'
+
+    *> sort the array
+    move 0 to sorted-len
+    perform varying a from 1 by 1 until a > a-lim
+        *> find the insertion point
+        perform varying s from 1 by 1
+        until s > sorted-len
+        or array(a) <= sorted-array(s)
+            continue
+        end-perform
+
+        *>open the insertion point
+        perform varying o from sorted-len by -1
+        until o < s
+            compute o1 = o + 1
+            move sorted-array(o) to sorted-array(o1)
+        end-perform
+
+        *> move the array-entry to the insertion point
+        move array(a) to sorted-array(s)
+
+        add 1 to sorted-len
+    end-perform
+
+    *> display the sorted array
+    perform varying s from 1 by 1 until s > sorted-lim
+        display space sorted-array(s) with no advancing
+    end-perform
+    display space 'sorted array'
+
+    stop run
+    .
+end program insertionsort.