Just another update

Task/Sorting-algorithms-Quicksort/Python/sorting-algorithms-quicksort-6.py

@@ -0,0 +1,7 @@
+def qsort(array):
+    if len(array) < 2:
+        return array
+    head, *tail = array
+    less = qsort([i for i in tail if i < head])
+    more = qsort([i for i in tail if i >= head])
+    return less + [head] + more

Task/Sorting-algorithms-Quicksort/Python/sorting-algorithms-quicksort-7.py

@@ -0,0 +1,17 @@
+def quicksort(array):
+    _quicksort(array, 0, len(array) - 1)
+
+def _quicksort(array, start, stop):
+    if stop - start > 0:
+        pivot, left, right = array[start], start, stop
+        while left <= right:
+            while array[left] < pivot:
+                left += 1
+            while array[right] > pivot:
+                right -= 1
+            if left <= right:
+                array[left], array[right] = array[right], array[left]
+                left += 1
+                right -= 1
+        _quicksort(array, start, right)
+        _quicksort(array, left, stop)