快速排序，归并排序模板

快速排序

#include<iostream>
using namespace std;
const int N = 100010;
int q[N];
int n;
void quick_sort(int q[],int l,int r){
    if(l>=r) return;
    int x=q[l + r >>1];
    int i=l-1;
    int j=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);
    
}
int main(){
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>q[i];
    }
    int l,r;
    quick_sort(q,0,n-1);
    
    for(int i=0;i<n;i++){
        cout<<q[i]<<" ";
    }
    
    cout<<endl;
    return 0;
}

归并排序

#include<bits/stdc++.h>
using namespace std;
const int N = 100010;
int q[N],temp[N];
int n;
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;
    int i=l;
    int j=mid+1;
    while(i<=mid&&j<=r){
        if(q[i]<=q[j]) temp[k++]=q[i++];
        else temp[k++]=q[j++];
    }
    
    while(i<=mid) temp[k++]=q[i++];
    while(j<=r) temp[k++]=q[j++];
    
    for(int i=l,j=0;i<=r;i++,j++) q[i]=temp[j];
}

int main(){
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>q[i];
    }
    
    merge_sort(q,0,n-1);
    
    for(int i=0;i<n;i++){
        cout<<q[i]<<" ";
    }
    cout<<endl;
    return 0;
}