2-路归并

#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100;
void merge(int A[], int L1, int R1, int L2, int R2){     //二分思想实现两个增序序列变为一个增序系列
    int i = L1, j = L2;
    int temp[maxn], index = 0;
    while(i <= R1 && j <= R2){
        if(A[i] <= A[j]){
            temp[index++] = A[i++];
        } else {
            temp[index++] = A[j++];
        }
    }
    while(i <= R1) temp[index++] = A[i++];
    while(j <= R2) temp[index++] = A[j++];
    for(i = 0; i < index; i++){
        A[L1 + i] = temp[i];
    }
}
//递归实现
void dg_mergeSort(int A[], int left, int right){
    if(left < right){
        int mid = (left + right) / 2;
        dg_mergeSort(A, left, mid);
        dg_mergeSort(A, mid + 1, right);
        merge(A, left, mid, mid + 1, right);
    }
}
//非递归实现第一种方法
void one_mergeSort(int A[], int n){
    for(int step = 2; step / 2 <= n; step *= 2){
        for(int i = 1; i <= n; i += step){
            int mid = i + step / 2 - 1;
            if(mid + 1 <= n){
                merge(A, i, mid, mid + 1, min(i + step - 1, n));
            }
        }
    }
}
int main(){
    int a[10] = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
    dg_mergeSort(a, 0, 9);
    for(int i = 0; i < 10; i++){
        printf("%d", a[i]);
    }
    return 0;
}