#include <stdio.h>

// Function to merge two sorted arrays
void mergeSortedArrays(int arr1[], int size1, int arr2[], int size2, int mergedArr[]) {
    int i = 0, j = 0, k = 0;

    // Merge elements from both arrays in ascending order
    while (i < size1 && j < size2) {
        if (arr1[i] < arr2[j]) {
            mergedArr[k++] = arr1[i++];
        } else {
            mergedArr[k++] = arr2[j++];
        }
    }

    // Copy any remaining elements from arr1
    while (i < size1) {
        mergedArr[k++] = arr1[i++];
    }

    // Copy any remaining elements from arr2
    while (j < size2) {
        mergedArr[k++] = arr2[j++];
    }
}

int main() {
    int arr1[] = {1, 3, 5, 7};  // First sorted array
    int arr2[] = {2, 4, 6, 8, 9};  // Second sorted array
    int size1 = sizeof(arr1) / sizeof(arr1[0]);
    int size2 = sizeof(arr2) / sizeof(arr2[0]);
    int mergedArr[size1 + size2];  // Array to store the merged result

    // Call function to merge arrays
    mergeSortedArrays(arr1, size1, arr2, size2, mergedArr);

    // Print the merged sorted array
    printf("Merged Sorted Array: ");
    for (int i = 0; i < size1 + size2; i++) {
        printf("%d ", mergedArr[i]);
    }

    return 0;
}