【算法】归并排序

#include<iostream>
using namespace std;
const int N = 1000010;
int n;
int q[N],temp[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,i=l,j=mid+1;
	while(i<=mid && j<=r){
		if(q[i] <= q[j]) temp[k++] = q[i++];
		else temp[k++] = q[j++];
	} 
	//将剩下的放入temp中
	while(i<=mid) temp[k++]=q[i++];
	while(j<=r) temp[k++]=q[j++];
	 
	//将整理后temp中的元素放入到q中
	for(i=l,j=0;i<=r;i++,j++){
		q[i]=temp[j];
	} 
	
	
	
}

int main (){
	
	scanf("%d",&n);
	
	for (int i=0;i<n;i++) scanf("%d",&q[i]) ;
	
	merge_sort(q,0,n-1);
	
	for(int i = 0;i<n;i++) printf("%d ",q[i]);
		
	return 0;
	
}