Data update

Task/Sorting-algorithms-Merge-sort/Jactl/sorting-algorithms-merge-sort.jactl

@@ -0,0 +1,19 @@
+def mergesort(x) {
+  return x if x.size() <= 1
+  def left  = mergesort(x.subList(0,x.size()/2))
+  def right = mergesort(x.subList(x.size()/2))
+  return left + right if left[-1] <= right[0]
+  return merge(left, right)
+}
+
+def merge(left, right) {
+  def result = []
+  while (left.size() > 0 && right.size() > 0) {
+    [result <<= left[0],  left = left.subList(1)] and continue if left[0] < right[0]
+    [result <<= right[0], right = right.subList(1)]
+  }
+  result += left; result += right
+}
+
+def numbers = 10.map{ random(20) }
+println "Numbers: $numbers, sorted: ${mergesort(numbers)}"