//简单插入排序
void insertSort(int *a,int n)
{
if(a==NULL||n<=1)
return;
for(int i=1;i<n;i++)
{
int j=i-1;
int x=a[i];
while(j>=0&&a[j]>x)
{
a[j+1]=a[j];
j--;
}
a[j+1]=x;
}
}
//希尔排序
void shell(int *a,int n,int k)
{
for(int i=k;i<n;i++)
{
int j=i-k;
int x=a[i];
while(j>=0&&a[j]>x)
{
a[j+k]=a[j];
j-=k;
}
a[j+k]=x;
}
}
void shellSort(int *a,int n)
{
if(a==NULL||n<=1)
return;
int k=n/2;
while(k)
{
shell(a,n,k);
k/=2;
}
}
//选择排序
void selectSort(int *a,int n)
{
if(a==NULL||n<=1)
return;
for(int i=0;i<n-1;i++)
{
int x=i;
for(int j=i+1;j<n;j++)
{
if(a[j]<a[x])
x=j;
}
if(x!=i)
{
a[x]^=a[i];
a[i]^=a[x];
a[x]^=a[i];
}
}
}
//堆排序
void heap(int *a,int n,int i) //堆调整改进版,不交换
{
int child;
int tmp=a[i];
for(;2*i+1<n;i=child)
{
child=2*i+1;
if(child+1<n&&a[child]<a[child+1])
child++;
if(tmp<a[child])
a[i]=a[child];
else
break;
}
a[i]=tmp;
}
void heap1(int *a,int n,int i) //堆调整
{
int child;
for(;2*i+1<n;i=child)
{
child=2*i+1;
if(child+1<n&&a[child]<a[child+1])
child++;
if(a[i]<a[child])
{
a[i]^=a[child];
a[child]^=a[i];
a[i]^=a[child];
}
else
break;
}
}
void heapSort(int *a,int n)
{
if(a==NULL||n<=1)
return;
for(int i=n/2-1;i>=0;i--)
heap(a,n,i);
for(int i=n-1;i>0;i--)
{
a[0]^=a[i];
a[i]^=a[0];
a[0]^=a[i];
heap(a,i,0);
}
}
//起泡排序
void QipaoSort(int *a,int n)
{
if(a==NULL||n<=1)
return;
for(int i=0;i<n-1;i++)
{
for(int j=0;j<n-i-1;j++)
{
if(a[j]>a[j+1])
{
a[j]^=a[j+1];
a[j+1]^=a[j];
a[j]^=a[j+1];
}
}
}
}
//快速排序
void QSort(int *a,int n)
{
if(a==NULL||n<=1)
return;
int i=0;
int j=n-1;
int x=a[i];
while(i<j)
{
for(;i<j;j--)
{
if(a[j]<x)
{
a[i++]=a[j];
break;
}
}
for(;i<j;i++)
{
if(a[i]>x)
{
a[j--]=a[i];
break;
}
}
}
a[i]=x;
QSort(a,i);
QSort(a+i+1,n-i-1);
}
//归并排序
void merge(int *a,int *b,int low,int m,int high)
{
int i=low;
int j=m+1;
int k=low;
while(i<=m&&j<=high)
{
if(a[i]<a[j])
b[k++]=a[i++];
else
b[k++]=a[j++];
}
while(i<=m)
b[k++]=a[i++];
while(j<=high)
b[k++]=a[j++];
}
void mergePass(int *a,int *b,int n,int len)
{
int i=0;
while(i+2*len-1<n)
{
merge(a,b,i,i+len-1,i+2*len-1);
i+=2*len;
}
if(i+len<n)
merge(a,b,i,i+len-1,n-1);
else
{
while(i<n)
{
b[i]=a[i];
i++;
}
}
}
void mergeSort(int *a,int n)
{
if(a==NULL||n<=1)
return;
int *b=new int[n];
int len=1;
while(len<n)
{
mergePass(a,b,n,len);
len*=2;
mergePass(b,a,n,len);
len*=2;
}
delete []b;
}
//基排序
int dight(int x,int k)
{
for(int i=1;i<k;i++)
x/=10;
return x%10;
}
void radixSort(int *a,int n,int d)
{
if(a==NULL||n<=1||d<1)
return;
int *bucket=new int[n];
const int radix=10;
int count[radix];
for(int k=1;k<=d;k++)
{
for(int i=0;i<radix;i++)
count[i]=0;
for(int i=0;i<n;i++)
count[dight(a[i],k)]++;
for(int i=1;i<radix;i++)
count[i]+=count[i-1];
for(int i=n-1;i>=0;i--)
{
int j=dight(a[i],k);
bucket[count[j]-1]=a[i];
count[j]--;
}
for(int i=0;i<n;i++)
a[i]=bucket[i];
}
delete []bucket;
}
#include<stdlib.h>
#include<sys/time.h>
#define N 1000000
#define random(i) (rand()%i)
int a[N];
int flag[N];
int main()
{
struct timeval tv;
int num=0;
while(num<N) //生产随机的无序数组
{
int buf=random(N);
if(flag[buf]==0)
{
flag[buf]=1;
a[num++]=buf;
}
}
cout<<"sort start"<<endl;
gettimeofday(&tv,NULL);
cout<<"sort start:"<<tv.tv_sec<<','<<tv.tv_usec<<endl; //开始排序时间点
//insertSort(a,N);
shellSort(a,N);
//selectSort(a,N);
//heapSort(a,N);
//QipaoSort(a,N);
//QSort(a,N);
//mergeSort(a,N);
//radixSort(a,N,6);
gettimeofday(&tv,NULL);
cout<<"sort end:"<<tv.tv_sec<<','<<tv.tv_usec<<endl; //完成排序时间点
int tmp=-1;
for(int i=0;i<N;i++) //检查是否排序成功
{
if(a[i]<tmp)
{
cout<<"wrong"<<endl;
break;
}
tmp=a[i];
}
return 0;
}