思想:对于插入排序来说,当其输入几乎是排好序的时候,运行时间是很快的。而快速排序的效果很不错,因此可以结合起来使用。当在一个长度小于k的子数组上调用快速排序时,让它不做任何排序就返回。当顶层的快速排序调用返回后,对整个数组运行插入排序。
完整源代码如下:
#include <stdlib.h>
#include<stdio.h>
#include<time.h>
#define MAXSIZE 100000
void exchange(int *a,int *b){
int temp;
temp = *a;
*a = *b;
*b = temp;
}
int partition(int A[],int p,int q){
int i=p-1,j=p;
int temp=A[q];
for(;j<q;j++){
if(A[j]<=temp) {
exchange(&A[i+1],&A[j]);
i++;
}
}
exchange(&A[i+1],&A[q]);
return i+1;
}
void quicksort_opt(int A[],int p,int q,int k){
int r ;
if(q-p>k) {
r= partition(A,p,q);
quicksort_opt(A,p,r-1,k);
quicksort_opt(A,r+1,q,k);
}
}
void quicksort(int A[],int p,int q){
int r ;
if(p<q) {
r= partition(A,p,q);
quicksort(A,p,r-1);
quicksort(A,r+1,q);
}
}
void isertionsort(int A[],int p,int q){
int i=p+1,j;
int temp;
for(;i<=q;i++){
temp=A[i];
for(j=i-1;j>=p && A[j]>temp;j--)
A[j+1]=A[j];
A[j+1]=temp;
}
}
void main(){
int i;
int A[MAXSIZE];
int k;
clock_t start_1,start_2;
clock_t duringtime_1, duringtime_2;
for(i=0;i<MAXSIZE;i++){
A[i]=rand();
}
start_1 = clock();
quicksort(A,0,MAXSIZE-1);
duringtime_1 = clock() - start_1;
printf("before optimizing: %f ms\n",( double)(duringtime_1));
for(k=0;k<=500;k+=40){
for(i=0;i<MAXSIZE;i++){
A[i]=rand();
}
start_2 = clock();
quicksort_opt(A,0,MAXSIZE-1,k);
isertionsort(A,0,MAXSIZE-1);
duringtime_2 = clock() - start_2;
printf("after optimizing:%8f ms k=%5d percentage:%f%%\n",( double)(duringtime_2),k,(double)(duringtime_1-duringtime_2)/(double)duringtime_1*100);
}
}