mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-10-05 21:29:29 +00:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2024-10-04 14:54:18 +00:00
parent dc7c493747
commit 5218d67532
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
sorts/quick_sort.py
View File

@ -27,7 +27,7 @@ def quick_sort(collection: list) -> list:
Space Complexity:
Best Case: O(log n) for In-place implementation
Worst Case: O(n)
Examples:
>>> quick_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5]
@ -45,9 +45,9 @@ def quick_sort(collection: list) -> list:
pivot = collection.pop(pivot_index)
# Initialise empty lists to store the elements
lesser = [] # Stores elements less than or equal to the pivot
greater = [] # Stores elements greater than the pivot
greater = [] # Stores elements greater than the pivot
# Loop through the collections and partition
for item in collection:
@ -55,7 +55,7 @@ def quick_sort(collection: list) -> list:
lesser.append(item)
else:
greater.append(item)
# Recursively sort the lesser and greater groups, and combine with the pivot
return [*quick_sort(lesser), pivot, *quick_sort(greater)]