import random
#冒泡排序
def bubbleSort(L):
assert (type(L)==type(['']))
length=len(L)
if length<=1:
return L
for i in range(length-1):
for j in range(length-1-i):
if L[j]<L[j+1]:
L[j],L[j+1]=L[j+1],L[j]
return L
#选择排序
def selectSort(L):
assert (type(L)==type(['']))
length=len(L)
if length<=1:
return L
def _max(s):
largest=s
for i in range(s,length):
if L[i]>L[largest]:
largest=i
return largest
for i in range(length):
largest=_max(i)
if i!=largest:
L[i],L[largest]=L[largest],L[i]
return L
#插入排序
def insertSort(L):
assert (type(L) == type(['']))
length = len(L)
if length <= 1:
return L
for i in range(1,length):
value=L[i]
j=i-1
while j>=0 and L[j]<value:
L[j+1]=L[j]
j-=1
L[j+1]=value
return L
#归并排序法
def mergeSort(l):
length = len(l)
if length <= 1:
return l
num=int(length/2)
left=mergeSort(l[:num])
right=mergeSort(l[num:])
return merge(left,right)
def merge(left,right):
l,r=0,0
result=[]
while l<len(left) and r<len(right):
if left[l]>right[r]:
result.append(left[l])
l+=1
else:
result.append(right[r])
r+=1
result+=left[l:]
result+=right[r:]
return result
#快速排序
def quickSort(l,s,e):
if s<e:
m=partition(l,s,e)
quickSort(l,s,m-1)
quickSort(l,m+1,e)
return l
def partition(l,start,end):
pivot=l[start]
leftmark=start+1
rightmark=end
while True:
while l[leftmark]<=pivot:
if leftmark==rightmark:
break
leftmark+=1
while l[rightmark]>pivot:
rightmark-=1
if leftmark<rightmark:
l[leftmark],l[rightmark]=l[rightmark],l[leftmark]
else:
break
l[start],l[rightmark]=l[rightmark],l[start]
return rightmark
lst=[random.randint(1,10) for x in range(10) ]
print (quickSort(lst,0,len(lst)-1))