Update sorts/quick_sort_3_partition.py

rename quick_sort_3partition to quick_sort_3part

Author: taseikyo

Diff for: sorts/quick_sort_3_partition.py

@@ -18,25 +18,25 @@ def quick_sort_3partition(sorting: list, left: int, right: int) -> list:
     quick_sort_3partition(sorting, b + 1, right)
 
 
-def quick_sort_3partition(sorting: list) -> list:
+def quick_sort_3part(sorting: list) -> list:
     """
     Another quick sort algorithm, returns a new sorted list
 
-    >>> quick_sort_3partition([])
+    >>> quick_sort_3part([])
     []
-    >>> quick_sort_3partition([1])
+    >>> quick_sort_3part([1])
     [1]
-    >>> quick_sort_3partition([-5, -2, 1, -2, 0, 1])
+    >>> quick_sort_3part([-5, -2, 1, -2, 0, 1])
     [-5, -2, -2, 0, 1, 1]
-    >>> quick_sort_3partition([1, 2, 5, 1, 2, 0, 0, 5, 2, -1])
+    >>> quick_sort_3part([1, 2, 5, 1, 2, 0, 0, 5, 2, -1])
     [-1, 0, 0, 1, 1, 2, 2, 2, 5, 5]
     """
     if len(sorting) <= 1:
         return sorting
     return (
-        quick_sort_3partition([i for i in sorting if i < sorting[0]])
+        quick_sort_3part([i for i in sorting if i < sorting[0]])
         + [i for i in sorting if i == sorting[0]]
-        + quick_sort_3partition([i for i in sorting if i > sorting[0]])
+        + quick_sort_3part([i for i in sorting if i > sorting[0]])
     )