python: 快速排序

python: 快速排序

#!/usr/bin/python3
# Filename: quicksort.py

def quicksort(list, big, small):
if big >= small:
return
key = big
key2 = small
while big != small:
while (small > big):
if list[small] < list[key]:
break
small -= 1
while (big <= small):
if big == small:
temp = list[big]
list[big] = list[key]
list[key] = temp
break
if list[big] > list[key]:
break
big += 1
temp = list[big]
list[big] = list[small]
list[small] = temp
quicksort(list, key, big-1)
quicksort(list, big+1, key2)

list = input().split()
list = [int(i) for i in list]
quicksort(list, 0, len(list)-1)
print (list)