排序算法-归并排序

#include <stdio.h>
#include <stdlib.h>

/**
没有利用空间的合并
*/
void insertMerge(int *a, int left, int mid, int right) {
    int i = mid+1, j, t;
    while ( i <= right) { // 把右边的值插入排序待左边
        t = a[i];
        j = i;
        while ( j > left && t < a[j-1]  ) {
            a[j] = a[j-1];
            j--;
        }
        a[j] = t;
        i++;
    }
}

/**
空间复杂度为O(n) 的合并
*/
void print_array(int *a, int len) {
    for (int i = 0; i < len; i++) {
        printf("%d ", a[i]);
    }
    printf("\n");
}

void merge(int *a, int left, int mid, int right) {
    int *res = (int *)calloc(sizeof(int), right-left+1);
    int i = left, j = mid+1, k = 0;

    while (i <= mid || j <= right) {
        if (  i <= mid && j <= right ) {
            res[k++] = a[i] < a[j] ? a[i++] : a[j++];
        } else if ( i <= mid ) {
            res[k++] = a[i++];
        } else if ( j <= right ) {
            res[k++] = a[j++];    
        }
    }
   	// 复制过程
    for ( i = left, k = 0; i <= right; i++) { 
        a[i] = res[k++];
    }
    free(res);
}

void mergeSort(int *a, int left, int right) {
    if (left < right) {
        int mid = (left + right) >> 1;
        mergeSort(a, left, mid);
        mergeSort(a, mid+1, right);
        merge(a, left, mid, right);
        // insertMerge(a, left, mid, right);
    }
}

int main() {
    int a[8] = {4, 1, 2, 5, 8, 6, 3, 7};

    print_array(a, 8);
    mergeSort(a, 0, 7);
    print_array(a, 8);
}

/** 执行结果：
4 1 2 5 8 6 3 7 
1 2 3 4 5 6 7 8 
*/

空间复杂度：O(n)
时间复杂度：O(n log n)