zinating
diff --git a/‎sorts/quick_sort_3_partition.py‎
Lines changed: 47 additions & 0 deletions b/‎sorts/quick_sort_3_partition.py‎
Lines changed: 47 additions & 0 deletions
@@ -18,6 +18,53 @@ def quick_sort_3partition(sorting: list, left: int, right: int) -> None:
     quick_sort_3partition(sorting, b + 1, right)
 
 
+def quick_sort_lomuto_partition(sorting: list, left: int, right: int) -> None:
+    """
+    A pure Python implementation of quick sort algorithm(in-place)
+    with Lomuto partition scheme:
+    https://en.wikipedia.org/wiki/Quicksort#Lomuto_partition_scheme
+
+    :param sorting: sort list
+    :param left: left endpoint of sorting
+    :param right: right endpoint of sorting
+    :return: None
+
+    Examples:
+    >>> nums1 = [0, 5, 3, 1, 2]
+    >>> quick_sort_lomuto_partition(nums1, 0, 4)
+    >>> nums1
+    [0, 1, 2, 3, 5]
+    >>> nums2 = []
+    >>> quick_sort_lomuto_partition(nums2, 0, 0)
+    >>> nums2
+    []
+    >>> nums3 = [-2, 5, 0, -4]
+    >>> quick_sort_lomuto_partition(nums3, 0, 3)
+    >>> nums3
+    [-4, -2, 0, 5]
+    """
+    if left < right:
+        pivot_index = lomuto_partition(sorting, left, right)
+        quick_sort_lomuto_partition(sorting, left, pivot_index - 1)
+        quick_sort_lomuto_partition(sorting, pivot_index + 1, right)
+
+
+def lomuto_partition(sorting: list, left: int, right: int) -> int:
+    """
+    Example:
+    >>> lomuto_partition([1,5,7,6], 0, 3)
+    2
+    """
+    pivot = sorting[right]
+    store_index = left
+    for i in range(left, right):
+        if sorting[i] < pivot:
+            sorting[store_index], sorting[i] = sorting[i], sorting[store_index]
+            store_index += 1
+    sorting[right], sorting[store_index] = sorting[store_index], sorting[right]
+    return store_index
+
+
 def three_way_radix_quicksort(sorting: list) -> list:
     """
     Three-way radix quicksort: