Sorting algorithms/Insertion sort: Difference between revisions

Content added Content deleted

Inline

@@ Line 3,130: / Line 3,130: @@
 }</lang>
-=={{header|Scala}}==
+=={{header|SASL}}==
-===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>
+<lang SASL>DEF
-DEF
 sort () = ()
 sort (a : x) = insert a (sort x)
@@ Line 3,149: / Line 3,139: @@
           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}}==