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

Update quick_sort.py

Browse Source 
Streamlining quick_sort function
This commit is contained in:
yyeltsyn 2016-08-29 11:29:49 +03:00 committed by GitHub
parent abd9d78a62
commit 66433a5f0b
1 changed files with 11 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
sorts/quick_sort.py
View File

@ -35,21 +35,20 @@ def quick_sort(collection):
>>> quick_sort([-2, -5, -45]) >>> quick_sort([-2, -5, -45])
[-45, -5, -2] [-45, -5, -2]
""" """
if len(collection) <= 1:
return collection
less = [] less = []
equal = [] equal = []
greater = [] greater = []
if len(collection) > 1: pivot = collection[0]
pivot = collection[0] for x in collection:
for x in collection: if x < pivot:
if x < pivot: less.append(x)
less.append(x) elif x == pivot:
if x == pivot: equal.append(x)
equal.append(x) else:
if x > pivot: greater.append(x)
greater.append(x) return quick_sort(less) + equal + quick_sort(greater)
return quick_sort(less) + equal + quick_sort(greater)
else:
return collection
if __name__ == '__main__': if __name__ == '__main__':