将两个递增有序的数组合并到另一个数组中用C语言完成

可以使用归并排序的思想，将两个有序数组合并到另一个数组中。具体实现如下：

#include <stdio.h>

void merge(int arr1[], int arr2[], int m, int n, int merged[]) {
    int i = 0, j = 0, k = 0;

    // 将arr1和arr2中的元素按顺序插入到merged数组中
    while (i < m && j < n) {
        if (arr1[i] < arr2[j]) {
            merged[k++] = arr1[i++];
        } else {
            merged[k++] = arr2[j++];
        }
    }

    // 将arr1或arr2中剩余的元素插入到merged数组中
    while (i < m) {
        merged[k++] = arr1[i++];
    }

    while (j < n) {
        merged[k++] = arr2[j++];
    }
}

int main() {
    int arr1[] = {1, 3, 5, 7, 9};
    int arr2[] = {2, 4, 6, 8, 10};
    int m = sizeof(arr1) / sizeof(arr1[0]);
    int n = sizeof(arr2) / sizeof(arr2[0]);
    int merged[m + n];

    merge(arr1, arr2, m, n, merged);

    printf("Merged array: ");
    for (int i = 0; i < m + n; i++) {
        printf("%d ", merged[i]);
    }
    printf("\n");

    return 0;
}

输出结果为：

Merged array: 1 2 3 4 5 6 7 8 9 10