1. /*
    2.     归并排序：
    4. */
    5. #include <stdio.h>
    6. #include <stdlib.h>
    7. static int *arrB = (int *)malloc(sizeof(int *)*20);
    8. void merge(int *arr, int low, int mid, int high) {//一次归并排序
    9.     int k, m, n;
    10.     for (int i = low; i <= high; i++) {
    11.         arrB[i] = arr[i];
    12.     }
    14.     for (m = low, n = mid + 1, k = m; m <= mid && n <= high;) {
    15.         if (arrB[m] <= arrB[n]) {
    16.             arr[k++] = arrB[m++];
    17.         }
    18.         else {
    19.             arr[k++] = arrB[n++];
    20.         }
    21.     }
    22.     while (n <= high)arr[k++] = arrB[n++];
    23.     while (m <= mid)arr[k++] = arrB[m++];
    24. }
    25. void mergeSort(int *arr, int low, int high) {
    26.     if (low < high) {
    27.         int mid = (low + high) / 2;
    28.         mergeSort(arr, low, mid);
    29.         mergeSort(arr, mid + 1, high);
    30.         merge(arr, low, mid, high);
    31.     }
    32. }
    33. int main() {
    34.     int arr[] = { 38,49,65,97,76,13,27 };
    35.     mergeSort(arr, 0, 6);
    36.     return 0;
    37. }