Question

*c language* Write a program that takes two sorted array A,B of size m,n respectively where A is sorted in the ascending order and B is sorted in the descending order, and merge these two arrays into a sorted array C.  

For example if A=[1, 4, 5, 7, 8] and B=[10,9,8,6,4,2]   then C=[1,2,4,4,5,6,7,8,8,9,10].

Answer 1

#include <stdio.h>

void merge(int A[], int B[], int C[], int m, int n) {
    int index1 = 0, index2 = n-1, i = 0;
    while (index1 < m || index2 >= 0) {
        if (index1 >= m || (index2 < n && B[index2] < A[index1])) {
            C[i++] = B[index2--];
        } else {
            C[i++] = A[index1++];
        }
    }
}

int main() {
    int i;
    int A[] = {1, 4, 5, 7, 8};
    int B[] = {10, 9, 8, 6, 4, 2};
    int C[11];
    merge(A, B, C, 5, 6);
    for (i = 0; i < 11; ++i) {
        printf("%d ", C[i]);
    }
    printf("\n");
    return 0;
}