mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-18 16:27:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update quick_sort.py (#830)

Browse Source 
Modify the list comprehensions to reduce the number of judgments, the speed has increased by more than 50%.
This commit is contained in:
BruceLee569 2019-05-24 23:54:03 +08:00 committed by John Law
parent 023f5e092d
commit a0ab3ce098
1 changed files with 10 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
sorts/quick_sort.py
View File

@ -34,8 +34,16 @@ def quick_sort(collection):
return collection return collection
else: else:
pivot = collection[0] pivot = collection[0]
greater = [element for element in collection[1:] if element > pivot] # Modify the list comprehensions to reduce the number of judgments, the speed has increased by more than 50%.
lesser = [element for element in collection[1:] if element <= pivot] greater = []
lesser = []
for element in collection[1:]:
if element > pivot:
greater.append(element)
else:
lesser.append(element)
# greater = [element for element in collection[1:] if element > pivot]
# lesser = [element for element in collection[1:] if element <= pivot]
return quick_sort(lesser) + [pivot] + quick_sort(greater) return quick_sort(lesser) + [pivot] + quick_sort(greater)