【C++/Java】归并排序模板

思想

1.从待排序元素中间进行拆分，一直拆分到只有一个元素，

2.把拆分的待排序元素进行两两合并，最后形成一个有序序序列，时间复杂度O(nlog^n)

C++实现

#include <iostream>
using namespace std;

const int N=1e6+10;

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++];
    while(i<=mid)temp[k++]=q[i++];
    while(j<=r)temp[k++]=q[j++];
    for(i=l,j=0;i<=r;i++,j++)q[i]=temp[j];
}




int main(){
    int n;
    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]);
    }
    
}

Java实现

import java.util.Scanner;

public class MergeSort {
    public static void mergeSort(int[] q,int[] t,int l,int r){
        if(l>=r)return;
        int mid = l + r >> 1;
        mergeSort(q,t,l,mid);
        mergeSort(q,t,mid+1,r);
        int k=0,i=l,j=mid+1;
        while(i<=mid && j<=r)
            if(q[i]<=q[j])t[k++]=q[i++];
        else t[k++]=q[j++];
        while (i<=mid)t[k++]=q[i++];
        while (j<=r)t[k++]=q[j++];
        for(i=l,j=0;i<=r;i++,j++)q[i]=t[j];
    }
    public static void main(String[] args) {
        int N=1000010;
        int[] q = new int[N];
        int[] t = new int[N];
        Scanner scanner = new Scanner(System.in);
        int n=scanner.nextInt();
        for(int i=0;i<n;i++){
            q[i]=scanner.nextInt();
        }
        mergeSort(q,t,0,n-1);
        for(int i=0;i<n;i++){
            System.out.print(q[i]+" ");
        }
    }
}