1
2
3
4
5
6
7
8
9
10
11
12
//快排
void quick_sort(int q[],int l,int r){
    if(l>=r)return;
    int i=l-1,j=r+1,x=q[i+j>>1];
    while(i<j){
        do i++;while(x>q[i]);
        do j--;while(x<q[j]);
        if(i<j)swap(q[i],q[j]);
    }
    quick_sort(q,l,j);
    quick_sort(q,j+1,r);
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
//归并排序
int tmp[];
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(int i=l,j=0;i<=r;i++,j++)q[i]=tmp[j];
}