Initial data commit

Task/Sorting-algorithms-Comb-sort/Objeck/sorting-algorithms-comb-sort.objeck

@@ -0,0 +1,33 @@
+bundle Default {
+  class Stooge {
+    function : Main(args : String[]) ~ Nil {
+      nums := [3, 5, 1, 9, 7, 6, 8, 2, 4];
+      CombSort(nums);
+      each(i : nums) {
+        IO.Console->Print(nums[i])->Print(",");
+      };
+      IO.Console->PrintLine();
+    }
+
+    function : CombSort(input : Int[]) ~ Nil {
+      gap : Float := input->Size();
+      swaps := true;
+      while(gap > 1 | swaps) {
+        gap /= 1.247330950103979;
+        if(gap < 1) { gap := 1; };
+        i : Int := 0;
+        swaps := false;
+        while(i + gap < input->Size()) {
+          igap : Int := i + gap->As(Int);
+          if (input[i] > input[igap]) {
+            swap : Int := input[i];
+            input[i] := input[igap];
+            input[igap] := swap;
+            swaps := true;
+          };
+          i += 1;
+        };
+      };
+    }
+  }
+}