Write a function that will merge the contents of two sorted (ascending order) arrays of type integer values, storing the result in an array output parameter (still in ascending order). The function should not assume that both its input parameter arrays are the same length but can assume that one array does not contain two copies of the same value. The result array should also contain no duplicate values. An example is shown below, where the value 15 appears in both input arrays, but the output array contains 15 only once. The function should receive input arrays as input arguments and output array as an output argument along with any other required arguments. The algorithm for such a function is shown below. Maintain two position pointers (simple integers) for the 2 input arrays. Compare elements of both arrays at these positions and increment appropriate pointer as shown in the figure below. Hint: When one of the input arrays has been exhausted, do not forget to copy the remaining data in the other array into the result array. Test your function with cases in which (1) the first array is exhausted first, (2) the second array is exhausted first, and (3) the two arrays are exhausted at the same time (i.e., they end with the same value). Remember that the arrays input to this function must already be sorted.
Write a function that will merge the contents of two sorted (ascending order) arrays of type integer values, storing the result in an array output parameter (still in ascending order). The function should not assume that both its input parameter arrays are the same length but can assume that one array does not contain two copies of the same value. The result array should also contain no duplicate values. An example is shown below, where the value 15 appears in both input arrays, but the output array contains 15 only once.
The function should receive input arrays as input arguments and output array as an output argument along with any other required arguments. The algorithm for such a function is shown below. Maintain two position pointers (simple integers) for the 2 input arrays. Compare elements of both arrays at these positions and increment appropriate pointer as shown in the figure below.
Hint: When one of the input arrays has been exhausted, do not forget to copy the remaining data in the other array into the result array. Test your function with cases in which (1) the first array is exhausted first, (2) the second array is exhausted first, and (3) the two arrays are exhausted at the same time (i.e., they end with the same value). Remember that the arrays input to this function must already be sorted.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 3 images
