YAPC::EU 2018 Glasgow Update!

Task/Sorting-algorithms-Merge-sort/Astro/sorting-algorithms-merge-sort-1.astro

@@ -1,17 +1,19 @@
-fun mergeSort(m):
-    if m.len <= 1: return m
-    let middle = floor m.len / 2
+fun mergesort(m):
+    if m.lenght <= 1: return m
+    let middle = floor m.lenght / 2
     let left = merge(m[:middle])
     let right = merge(m[middle-1:]);
 
 fun merge(left, right):
     let result = []
-    while not (left.isEmpty or right.isEmpty):
+    while not (left.isempty or right.isempty):
         if left[1] <= right[1]:
-            result ++ left.shift()
+            result.push left.shift()
         else:
-            result ++ right.shift()
-    result ++ left ++ right
+            result.push right.shift()
+    result.push left.push right
 
 let arr = [7, 6, 5, 9, 8, 4, 3, 1, 2, 0]
+print mergesort arr
+
 print mergeSort arr