Sorting algorithms/Insertion sort: Difference between revisions

Content added Content deleted

Inline

@@ Line 2,206: / Line 2,206: @@
 =={{header|EasyLang}}==
-<syntaxhighlight lang="text">subr sort
+<syntaxhighlight lang="text">
+func sort . d[] .
-  for i = 1 to len data[] - 1
-    h = data[i]
+  for i = 2 to len d[]
+    h = d[i]
     j = i - 1
-    while j >= 0 and h < data[j]
+    while j >= 1 and h < d[j]
-      data[j + 1] = data[j]
+      d[j + 1] = d[j]
       j -= 1
     .
-    data[j + 1] = h
+    d[j + 1] = h
   .
 .
 data[] = [ 29 4 72 44 55 26 27 77 92 5 ]
-call sort
+call sort data[]
-print data[]</syntaxhighlight>
+print data[]
+</syntaxhighlight>
 =={{header|Eiffel}}==