a = [10,100,45,60,90]
def quickSort(a,first, last):
if last-first<1:
return
pivot = a[first]
forward = first+1
backward = last
while forward < backward:
if a[forward] < pivot:
forward=forward+1
if a[backward] > pivot:
backward = backward -1
if a[forward] >= pivot and a[backward] < pivot:
temp = a[forward]
a[forward]=a[backward]
a[backward]=temp
forward=forward+1
backward = backward -1
if a[backward] < pivot:
temp = a[backward]
a[backward]= pivot
a[first] =temp
quickSort(a,first,backward-1)
quickSort(a,backward+1,last)
return a
b=quickSort(a,0,len(a)-1)
print b
Tags:
需要在
forward <= backward
时循环:输出:
相关问题 更多 >
编程相关推荐