在C中递归地添加有序数组中的元素

#include <stdio.h>

void insertElement(int arr[], int element, int start, int end) {
    if (start > end) {
        arr[start] = element;
        return;
    }

    int mid = (start + end) / 2;

    if (element < arr[mid]) {
        insertElement(arr, element, start, mid - 1);
    } else if (element > arr[mid]) {
        insertElement(arr, element, mid + 1, end);
    } else {
        return;
    }
}

int main() {
    int arr[10] = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19};
    int element = 8;
    int length = sizeof(arr) / sizeof(arr[0]);

    insertElement(arr, element, 0, length - 1);

    printf("插入元素后的数组：");
    for (int i = 0; i < length; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");

    return 0;
}