Question

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. a) Implement the solution in C++ using primitive data types. b) What is the time complexity of populating the emerging array?

Answer 1

Answer:

I don't no answer

Explanation:

ok but answer not