Initial data commit

Task/Sorting-algorithms-Quicksort/EasyLang/sorting-algorithms-quicksort.easy

@@ -0,0 +1,28 @@
+proc qsort left right . d[] .
+   while left < right
+      # partition
+      piv = d[left]
+      mid = left
+      for i = left + 1 to right
+         if d[i] < piv
+            mid += 1
+            swap d[i] d[mid]
+         .
+      .
+      swap d[left] d[mid]
+      #
+      if mid < (right + left) / 2
+         call qsort left mid - 1 d[]
+         left = mid + 1
+      else
+         call qsort mid + 1 right d[]
+         right = mid - 1
+      .
+   .
+.
+func sort . d[] .
+   call qsort 1 len d[] d[]
+.
+d[] = [ 29 4 72 44 55 26 27 77 92 5 ]
+call sort d[]
+print d[]