There are 2 unordered array in the form of X [1..n] and Y [1..m], which are...

 

Transcribed Image Text:

There are 2 unordered array in the form of X [1..n] and Y [1..m], which are different from each other. Write an algorithm that finds all elements in array X that are not in array Y at 0(mlogm+nlogm) time. Assume that all the elements in X are different. You can use known algorithms inside your algorithm. There are 2 unordered array in the form of X [1..n] and Y [1..m], which are different from each other. Write an algorithm that finds all elements in array X that are not in array Y at 0(mlogm+nlogm) time. Assume that all the elements in X are different. You can use known algorithms inside your algorithm.

Answer rating: 100% (QA)

here is the solution this will provide you with a array of elements that are common in bo... View the full answer