C语言循环学习，堆排序与归并排序

//归并排序
void showArr(int arr[], int length) {
    for (int i = 0; i < length; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n----------------------\n");
}

void inputArr(int arr[], int length) {
    for (int i = 0; i < length; i++)
    {
        arr[i] = rand() % 20;
    }
}

void merge(int arr[], int low, int mid, int height, int* temp) {
    int i = low;
    int j = mid + 1;
    int k = low;
    while (i <= mid && j <= height) 
        temp[k++] = arr[i] < arr[j] ? arr[i++] : arr[j++];
    while (i <= mid) 
        temp[k++] = arr[i++];
    while (j <= height)
        temp[k++] = arr[j++];
    for (i = low; i <= height; i++)
        arr[i] = temp[i];
}

void merge_sort(int arr[], int low, int height, int* temp) 
{
    if (low >= height) 
        return;
    int mid = low + (height - low) / 2;
    merge_sort(arr, low, mid, temp);
    merge_sort(arr, mid + 1, height, temp);
    merge(arr, low, mid, height, temp);
}

void mergeSort(int arr[], int length) {
    int *temp = (int*)malloc(sizeof(int) * length);
    assert(temp);
    merge_sort(arr, 0, length - 1, temp);
    free(temp);
}

int main()
{
    srand((unsigned int)time(NULL));
    int arr[MAXSIZE];
    inputArr(arr, MAXSIZE);
    showArr(arr, MAXSIZE);
    mergeSort(arr, MAXSIZE);//
    showArr(arr, MAXSIZE);
    system("pause");
    return 0;
}

void heapify(int arr[], int current, int length) {
    int rchild = (current << 1) + 2;
    int large;
    while (rchild <= length && (arr[large = rchild == length ? rchild - 1 : (arr[rchild - 1] > arr[rchild] ? rchild - 1 : rchild)] > arr[current])) {
        swap(arr, large, current);
        current = large;
        rchild = (current << 1) + 2;
    }
}

void heapSort(int arr[], int length) {
    int current = length >> 1;
    while (current >= 0) heapify(arr, current--, length);
    while (length) {
        swap(arr, 0, --length);
        heapify(arr, 0, length);
    }
}

相比于之前的简单排序，归并排序与堆排序就是要用到树的概念，以及更加复杂一点的排序逻辑。