Sorting algorithms/Insertion sort: Difference between revisions

Content added Content deleted

Inline

@@ Line 872: / Line 872: @@
 end</lang>
+=={{header|Elena}}==
+ELENA 3.2.1 :
+<lang elena>import extensions.
+extension $op
+{
+    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.
+            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).
+    console printLine("before:", list).
+    console printLine("after :", list insertionSort).
+].</lang>
+{{out}}
+<pre>
+before:3,9,4,6,8,1,7,2,5
+after :1,2,3,4,5,6,7,8,9
+</pre>
 =={{header|Elixir}}==