Sorting algorithms/Insertion sort: Difference between revisions

Content deleted Content added

Inline

@@ Line 2,849: / Line 2,849: @@
 =={{header|Scala}}==
+===version 1===
+<lang scala>def insertSort[X](list: List[X])(implicit ord: Ordering[X]) = {
+  def insert(list: List[X], value: X) = list.span(x => ord.lt(x, value)) match {
+    case (lower, upper) => lower ::: value :: upper
+  }
+  list.foldLeft(List.empty[X])(insert)
+}</lang>
+===version 2===
 Copied from SASL manual, Appendix II, answer (2)(a)
 <lang SASL>
@@ Line 2,858: / Line 2,867: @@
           b : insert a x
 ?</lang>
-=={{header|Scala}}==
-<lang scala>def insertSort[X](list: List[X])(implicit ord: Ordering[X]) = {
-  def insert(list: List[X], value: X) = list.span(x => ord.lt(x, value)) match {
-    case (lower, upper) => lower ::: value :: upper
-  }
-  list.foldLeft(List.empty[X])(insert)
-}</lang>
 =={{header|Scheme}}==