mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 13:31:07 +00:00
25 lines
769 B
Python
25 lines
769 B
Python
def quick_sort_3partition(sorting, left, right):
|
|
if right <= left:
|
|
return
|
|
a = i = left
|
|
b = right
|
|
pivot = sorting[left]
|
|
while i <= b:
|
|
if sorting[i] < pivot:
|
|
sorting[a], sorting[i] = sorting[i], sorting[a]
|
|
a += 1
|
|
i += 1
|
|
elif sorting[i] > pivot:
|
|
sorting[b], sorting[i] = sorting[i], sorting[b]
|
|
b -= 1
|
|
else:
|
|
i += 1
|
|
quick_sort_3partition(sorting, left, a - 1)
|
|
quick_sort_3partition(sorting, b + 1, right)
|
|
|
|
if __name__ == '__main__':
|
|
user_input = input('Enter numbers separated by a comma:\n').strip()
|
|
unsorted = [ int(item) for item in user_input.split(',') ]
|
|
quick_sort_3partition(unsorted,0,len(unsorted)-1)
|
|
print(unsorted)
|