归并排序 c++实现

归并排序的核心是划分，不断地把数组分成两段

#include <iostream>
#include <algorithm>
using namespace std;
int arr[1001];

void merge_sort(int mi, int mj){
    if(mi == mj) return;
    //if(mj - mi == 1) {if(arr[mi] > arr[mj]) swap(arr[mi], arr[mj]); return;}

    merge_sort(mi, (mi + mj)/2);
    merge_sort((mi + mj)/2 + 1, mj);
    int i = mi, j = (mi + mj)/2 + 1, arrt[1001];
    for(int k = mi; k <= mj; k++){
        if(i <= (mi + mj)/2 && arr[i] <= arr[j] || j > mj) arrt[k] = arr[i++];
        else arrt[k] = arr[j++];
    }
    for(int k = mi; k <= mj; k++) arr[k] = arrt[k];
}

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