Problem Link - Merging 2 arrays
Problem Statement:
Merging two 1D arrays involves combining the elements of both arrays into a single array while maintaining their original order.
Approach:
The key idea of this solution is to combine two arrays into one larger array by sequentially copying the elements from both original arrays into a new array. Here’s how it works:
-
Create a Merged Array: A new array is created to hold all the elements from both input arrays. The size of this merged array is the sum of the sizes of the two original arrays.
-
Copy Elements from the First Array: Use a loop to iterate through each element of the first array and copy each element into the merged array. This starts at the beginning of the merged array.
-
Copy Elements from the Second Array: Use another loop to iterate through each element of the second array. Each element is copied into the merged array starting at the index immediately after the last copied element from the first array.
-
Print the Merged Array: Finally, another loop is used to print all the elements in the merged array.
Time Complexity:
O(n + m), where n is the size of the first array and m is the size of the second array. This is because we need to go through each element of both arrays to copy them.
Space Complexity:
O(n + m) for the merged array, as it stores all the elements from both input arrays.