Consider two sorted integer arrays A and B in ascending order. We want two merge the two arrays to form a separate sorted array without violating the ascending order of the values. (1) Implement the solution in C++ using primitive data types. (2) What is the time complexity of populating the emerging array?
Answers
Answered by
7
Answer:
out. print(arr2[x] + " "); The sorted arrays are merged into a single array using a while loop. After the while loop, if any elements are left in arr1 or arr2, then they are added to the merged array.
Answered by
0
Answer its 89
Explanation:
Similar questions