1.简单排序::冒泡,直接插入,选择
插入排序:
a[MAXLEN]
int i=1,j=0;
int tmp=0;
for(i=1;i<MAXLEN;i++)
{
tmp=a[i];
for(j=i;j>0&&a[j-1]>tmp;j--)
a[j]=a[j-1];
a[j]=tmp;
}
冒泡排序:
int i=0,j=0;
int tmp=0;
bool flag=false;
for(i=0;i<MAXLEN;i++)
{
flag=false;
for(j=0;j<MAXLEN-i-1;j++)
{ if(a[j]>a[j+1])
{
tmp=a[j+1];
a[j+1]=a[j];
a[j]=tmp;
flag=true;
}
}
if(flag==false)
break;
}
选择排序:
int i=0,j=0;
int min=0;
int tmp=a[min];
for(i=0;i<MAXLEN;i++)
{
min=i;
for(j=i;j<MAXLEN;j++)
{
if(a[j]<a[min])
min=j;
}
if(min!=i)
{
tmp=a[i];
a[i]=a[min];
a[min]=tmp;
}
}
2.快速排序
QSort(a,0,N); //N=MAXLEN-1 N is array length-1
void QSort(int *a,int low,int high)
{
if(low<high)
{
int m=QPartition(a,low,high);
QSort(a,low,m-1);
QSort(a,m+1,high);
}
}
int QPartition(int *a,int low,int high)
{
int key=low,tmp=0;
tmp=a[low];
while(low<high)
{
while(tmp<=a[high]&&low<high)
high--;
a[low]=a[high];
while(tmp>=a[low]&&low<high)
low++;
a[high]=a[low];
}
a[low]=tmp;
return low;
}
3.堆排序 HeapSort(a,N); //N is array length
void HeapAdjust(int *a,int x,int y)
{
int rc=a[x-1];
for(int j=2*x;j<=y;j*=2)
{
if(j<y&&(a[j-1]<a[j+1-1]))// j+1 is bigger
j++; //j is the big one x
if(rc>a[j-1]) //rc is biggest,break; j j=j+1
break;
a[x-1]=a[j-1]; //swap x j
x=j;
}
a[x-1]=rc;
}
void HeapSort(int *a,int N)
{
int i=0;
int tmp=0;
for(i=N/2;i>0;i--)
{
HeapAdjust(a,i,N);
}
int br=0;
for(i=N;i>1;i--)
{
tmp=a[0];
a[0]=a[i-1];
a[i-1]=tmp;
HeapAdjust(a,1,i-1);
}
}
4.归并排序 MergeSort(a,N);//N is array length
void MergeSort(int *a,int N)
{
int b[MAXLEN];
MSort(a,b,1,N);
}
void MSort(int *a,int *b,int s,int t)
{
if(s<t)
{
int m=(s+t)/2;
MSort(a,b,s,m);
MSort(a,b,m+1,t);
Merge(a,b,s,m,t);
}
}
void Merge(int *a,int *b,int i,int m,int n)
{
int j=m+1;
int k=i;
int len=n-i+1;
while(i<=m&&j<=n)
{
if(a[i-1]<=a[j-1])
{
b[k-1]=a[i-1];
i++;
}
else
{
b[k-1]=a[j-1];
j++;
}
k++;
}
int p=0;
int tmp=0;
if(i<=m)//j has >n
{
tmp=m-i+1;
for(p=0;p<tmp;p++)
b[k+p-1]=a[i+p-1];
}
if(j<=n)// i has >m
{
tmp=n-j+1;
for(p=0;p<tmp;p++)
b[k+p-1]=a[j+p-1];
}
for(p=0;p<len;p++)
a[n-p-1]=b[n-p-1];
}