September Morn Update

Task/Sorting-algorithms-Insertion-sort/Elena/sorting-algorithms-insertion-sort.elena

@@ -1,33 +1,33 @@
-import extensions.
+import extensions;
 
-extension $op
+extension op
 {
-    insertionSort
-        = self clone; insertionSort(0, self length - 1).
+    insertionSort()
+        = self.clone().insertionSort(0, self.Length - 1);
 
-    insertionSort(IntNumber first, IntNumber last)
-    [
-        (first + 1) to:last do(:i)
-        [
-            var entry := self[i].
-            int j := i.
+    insertionSort(int first, int last)
+    {
+        for(int i := first + 1, i <= last, i += 1)
+        {
+            var entry := self[i];
+            int j := i;
 
-            while ((j > first)&& $(self[j - 1] > entry))
-            [
-                self[j] := self[j - 1].
+            while (j > first && self[j - 1] > entry)
+            {
+                self[j] := self[j - 1];
 
                 j -= 1
-            ].
+            };
 
             self[j] := entry
-        ]
-    ]
+        }
+    }
 }
 
-program =
-[
-    var list := (3, 9, 4, 6, 8, 1, 7, 2, 5).
+public program()
+{
+    var list := new int[]{3, 9, 4, 6, 8, 1, 7, 2, 5};
 
-    console printLine("before:", list).
-    console printLine("after :", list insertionSort).
-].
+    console.printLine("before:", list.asEnumerable());
+    console.printLine("after :", list.insertionSort().asEnumerable());
+}