算法基础 2、分治

2、归并排序－－分治
0、确定分界点mid=（l+r）/2 1、递归排序左右 2、归并、合二为一

#include<iostream>
using namespace std;
const int N =100010;
int n;
int q[N], tmp[N];

void merge_sort(int q[], int l, int r) {
    if (l >= r) return;
    int mid = (l + r )>> 1;
    int i = l, j = mid + 1, k = 0;
    merge_sort(q, l, mid), merge_sort(q, mid + 1, r);
    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 ( i = l, k = 0; i <= r; i++, k++) q[i] = tmp[k];
}

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;
}

注意：N的值、并时i从l开始r结束、输出含有空格