1.快速排序
def partition(A,p,q):
x=A[p];
i=p;
for j in xrange(p+1,q+1):
if A[j]<x:
i=i+1;
temp=A[j];
A[j]=A[i];
A[i]=temp;
tmp=A[i];
A[i]=A[p];
A[p]=tmp;
return i;
def QuickSort(A,p,q):
if p<q:
i=partition(A,p,q);
QuickSort(A,p,i-1);
QuickSort(A,i+1,q);
A=[1,32,5,46,57,68,34,5,768,3,234,123,35,2];
QuickSort(A,0,len(A)-1);
print A;
2.插入排序
def InsertSort(A):
for i in xrange(1,len(A)):
key=A[i];
j=i-1;
while j>=0 and A[j]>key :
A[j+1]=A[j];
j-=1;
A[j+1]=key;
A=[32,5,46,57,68,34,5,768,3,234,123,35,2,1];
InsertSort(A);
print A;
3.归并排序
def Merge(A,B,p,r,q):
i=p;
j=r+1;
k=0;
while i<=r and j<=q:
if A[i]>A[j]:
B[k]=A[j];
j+=1;
k+=1;
else:
B[k]=A[i];
i+=1;
k+=1;
if i<=r:
while i<=r:
B[k]=A[i];
k+=1;
i+=1;
if j<=q:
while j<=q:
B[k]=A[j];
k+=1;
j+=1;
for x in range(0,k):
A[p+x]=B[x];
def MergeSort(A,p,q,B):
if p<q:
i=(q+p)/2;
MergeSort(A,p,i,B);
MergeSort(A,i+1,q,B);
Merge(A,B,p,i,q);
A=[32,5,46,57,68,34,5,768,3,234,123,35,2,1];
B=[32,5,46,57,68,34,5,768,3,234,123,35,2,1];#just for making B.len is the same with A;
MergeSort(A,0,len(A)-1,B);
print A;
4.counting Sort
C=[0,0,0,0,0,0];
A=[1,2,4,1,4,5,1,5,0,1,2,4,5,1,2,1,1,2,0,3,2,3,5];
B=[1,2,4,1,4,5,1,5,0,1,2,4,5,1,2,1,1,2,0,3,2,3,5];
for x in A:
C[x]+=1;
for x in xrange(1,len(C)):
C[x]=C[x-1]+C[x];
for x in reversed(A):
B[C[x]-1]=x;
C[x]-=1;
print B;