Python算法之快速排序:
def fast_sort(alist, first, end):
if first >= end:
return
low = first
high = end
mid_value = alist[low]
while low < high:
while low < high and alist[high] >= mid_value:
high -= 1
alist[high], alist[low] = alist[low], alist[high]
while low < high and alist[low] < mid_value:
low += 1
alist[low], alist[high] = alist[high], alist[low]
alist[low] = mid_value
fast_sort(alist, first, low-1)
fast_sort(alist, low+1, end)
return alist
if __name__ == "__main__":
alist = list(map(int, input().split()))
print(fast_sort(alist, 0, len(alist) - 1))
时间复杂度为:O(nlogn)