Data update

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

@@ -1,24 +1,17 @@
 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
-         qsort left mid - 1 d[]
-         left = mid + 1
-      else
-         qsort mid + 1 right d[]
-         right = mid - 1
+   if left >= right
+      return
+   .
+   mid = left
+   for i = left + 1 to right
+      if d[i] < d[left]
+         mid += 1
+         swap d[i] d[mid]
       .
    .
+   swap d[left] d[mid]
+   qsort left mid - 1 d[]
+   qsort mid + 1 right d[]
 .
 proc sort . d[] .
    qsort 1 len d[] d[]