C 快排和归并排序

#include <stdio.h>
#include <malloc.h>

void quickSort(int* arr, int start, int end) {
    if (start == end) {
        return;
    }

    int i = start, j = end;
    int cmpElement = arr[i];

    while(i < j) {
        while(i < j) {
            if (arr[j] < cmpElement) {
                arr[i++] = arr[j];
                break;
            } else {
                j--;
            }
        }
        while(i < j) {
            if (arr[i] > cmpElement) {
                arr[j--] = arr[i];
                break;
            } else {
                i++;
            }
        }
    }

    arr[i] = cmpElement;

    quickSort(arr, start, i);
    quickSort(arr, i + 1, end);
}

void merge(int* arr, int low, int mid, int high) {
    int i = low, j = mid + 1, k = low;
    int* results;
    results = (int*)malloc(sizeof(int) * (high - low + 1));

    while(i <= mid && j <= high) {
        if (arr[i] < arr[j]) {
            results[k++] = arr[i++];
        } else {
            results[k++] = arr[j++];
        }
    }

    while(i <= mid) {
        results[k++] = arr[i++];
    }

    while(j <= high) {
        results[k++] = arr[j++];
    }

    for (i = low; i <= high; i++) {
        arr[i] = results[i];
    }
}

void mergeSort(int* arr, int start, int end) {
    if (start == end) {
        return;
    } else {
        int mid = (start + end) / 2;
        mergeSort(arr, start, mid);
        mergeSort(arr, mid + 1, end);
        merge(arr, start, mid, end);
    }
}

int main() {
    int num, arr[20];

    scanf("%d", &num);

    for (int i = 0; i < num; i++) {
        scanf("%d", &arr[i]);
    }

    // quickSort(arr, 0, num - 1);
    mergeSort(arr, 0, num - 1);

    for (int i = 0; i < num; i++) {
        printf("%d ", arr[i]);
    }

    printf("\n");

    return(0);
}