八大排序算法比较与实现

1.排序方法比较

2.直接插入排序

void StraightInsertSort(int elem[],int n){
	for(int i=1;i<n;i++){
		int e=elem[i],j;
		for(j=i-1;j>=0&&elem[j]>e;j--)		
			elem[j+1]=elem[j];
		elem[j+1]=e;
	}
}

3.BubbleSort冒泡排序

void BubbleSort(int elem[],int n){
	for(int i=0;i<n-1;i++)
		for(int j=i+1;j<n;j++){
			if(elem[i]>elem[j]){
				int temp=elem[i];
				elem[i]=elem[j];
				elem[j]=temp;
			}
	}
}

4.shell希尔排序

void ShellSort(int elem[],int n,int incr[],int incrn){
	auto fun=[=,&elem](int incr){
		for(int i=incr;i<n;i++){
			int e=elem[i],j;
			for(j=i-incr;j>=0&&elem[j]>e;j-=incr)		
				elem[j+incr]=elem[j];
			elem[j+incr]=e;
		}
	};
	for(int i=0;i<incrn;i++){
		//ShellInsert(elem,n,incr[i]);
		fun(incr[i]);
	}
}

5.快速排序

int quickSortOnce(int elem[],int low,int high){
	auto swap=[](int &a,int &b){int tmp=a;a=b;b=tmp;};
	int e=elem[low];
	while(low<high){
		while(low<high&&elem[high]>=e)
			high--;
		swap(elem[low],elem[high]);
		while(low<high&&elem[low]<=e)
			low++;
		swap(elem[low],elem[high]);
	}
	return low;
}
void quickSort(int elem[],int low,int high){
	if(low<high){
		int center=quickSortOnce(elem,low,high);
		quickSort(elem,low,center-1);
		quickSort(elem,center+1,high);
	}
}

6.简单选择排序

void simpleSelectSort(int elem[],int n){
	auto swap=[](int &a,int &b){int tmp=a;a=b;b=tmp;};
	for(int i=0;i<n-1;i++){
		int lowIndex=i;
		for(int j=i+1;j<n;j++){
			if(elem[j]<elem[lowIndex])
				lowIndex=j;
		}
		swap(elem[i],elem[lowIndex]);
	}
}

7.堆排序

void SiftAdjust(int elem[],int low,int high){
	auto swap=[](int &a,int &b){int tmp=a;a=b;b=tmp;};
	for(int f=low,i=2*low+1;i<=high;i=2*i+1){
		if(i<high&&elem[i]<elem[i+1])
			i++;
		if(elem[i]<=elem[f])
			break;
		swap(elem[i],elem[f]);
		f=i;
	}
}
void heapSort(int elem[],int n){
	auto swap=[](int &a,int &b){int tmp=a;a=b;b=tmp;};
	int i;
	for(i=(n-2)/2;i>=0;i--)
		SiftAdjust(elem,i,n-1);
	for(i=n-1;i>0;i--){
		swap(elem[0],elem[i]);
		SiftAdjust(elem,0,i-1);
	}
}

8.归并排序

void SimpleMerge(int elem[],int low,int mid,int high){
	int *tmpElem=new int[high+1];
	int i,j,k;
	for(i=low,j=mid+1,k=low;i<=mid&&j<=high;k++){
		if(elem[i]<elem[j]){
			tmpElem[k]=elem[i];
			i++;
		}
		else{
			tmpElem[k]=elem[j];
			j++;
		}
	}
	for(;i<=mid;i++,k++){
		tmpElem[k]=elem[i];
	}
	for(;j<=high;j++,k++){
		tmpElem[k]=elem[j];
	}
	for( i=low;i<=high;i++)
		elem[i]=tmpElem[i];
	delete[] tmpElem;
}
void SimpleMergeSort(int elem[],int low,int high){
	if(low<high){
		int mid=(low+high)/2;
		SimpleMergeSort(elem,low,mid);
		SimpleMergeSort(elem,mid+1,high);
		SimpleMerge(elem,low,mid,high);
	}
}