归并排序
设有数列{6,202,100,301,38,8,1}
初始状态:6,202,100,301,38,8,1
第一次归并后:{6,202},{100,301},{8,38},{1},比较次数:3;
第二次归并后:{6,100,202,301},{1,8,38},比较次数:4;
第三次归并后:{1,6,8,38,100,202,301},比较次数:4;
总的比较次数为:3+4+4=11;
void merge_sort(int q[],int l,int r){
if(l>=r) return ;
int mid=l+r >>1;
merge_sort(q,l,mid);
merge_sort(q,mid+1,r);
int k=0,i=l,j=mid+1;
while(i<=mid&&j<=r)
if(q[i]<q[j]) tmp[k++] =q[i++];
else tmp[k++]=q[j++];
while(i<=mid) tmp[k++]=q[i++];
while(j<=r) tmp[k++]=q[j++];
for(i=1,j=0;i<=r;i++,j++)
q[i]=tmp[j];
}
快排
一般都是用头文件algorithm中的sort函数
例子
void quick_sort(int q[],int l,int r){
if(l>=r) return ;
int i=l-1,j=r+1,x=q[l+r >>1];
while(i<j){
do i++;while(q[i]<x);
do j--;while(q[j]>x);
if(i<j) swap(q[i],q[j]);
}
quick_sort(q,l,j);
quick_sort(q,j+1,r);
}
#include<iostream>
using namespace std;
const int n=10;
int a[n]={5,2,7,4,1,9,8,3,5,6};
int tmp[n*2];
void quick_sort(int q[],int l,int r){
if(l>=r) return ;
int i=l-1,j=r+1,mid= i+ j >>1;
while(i<j){
do i++;while(q[i]<q[mid]);
do j--;while(q[j]>q[mid]);
if(i<j) swap(q[i],q[j]);
}
quick_sort(q,l,j);
quick_sort(q,j+1,r);
}
void merge_sort(int q[],int l,int r){
if(l>=r) return ;
int mid=l+r >>1;
merge_sort(q,l,mid);
merge_sort(q,mid+1,r);
int k=0,i=l,j=mid+1;
while(i<=mid&&j<=r){
if(q[i]<q[j]) tmp[k++]=q[i++];
else tmp[k++]=q[j++];
}
while(i<=mid) tmp[k++]=q[i++];
while(j<=r) tmp[k++]=q[j++];
for(i=l,j=0;i<=r;i++,j++)
q[i]=tmp[j];
}
void print(){
for(int i=0;i<n;i++)
cout<<a[i]<<" ";
cout<<endl;
}
int main(){
print();
merge_sort(a,0,9);
//quick_sort(a,0,9);
print();
}