时间复杂度:O(nlogn)
最坏情况:O(n^2)
代码实现:
def partition(data,left,right):
tmp = data[left]
while left < right:
while left < right and data[right] >= tmp:
right -= 1
data[left] = data[right]
while left < right and data[left] <= tmp:
left += 1
data[right] = data[left]
data[left] = tmp
return left
def quickSort(data,left,right):
if left < right:
p = partition(data,left,right)
quickSort(data,left,p-1)
quickSort(data,p+1,right)
data = [44,87,6,841,68,75,7,]
quickSort(data,0,len(data)-1)
print(data)