python实现快速排序法
以中轴分左右区的快速排序法：# -*- coding: utf-8 -*-
class QuickSort:
def sort(self,list,left,right):
if(left<right):
s=list[(left+right)/2]
i=left
j=right
while(True):
while(list<s):
i+=1
while(list>s):
j-=1
if(i>=j):
break
self.swap(list,i,j)
self.sort(list,left,i-1)
self.sort(list,j+1,right)
else:
return
def swap(self,list,i,j):
t=list
list=list
list=t
print 'begin:'
l=
l=list(set(l))#防止队列中含有重复数
print l
q=QuickSort()
q.sort(l,0,len(l)-1)
print l
页:
[1]