Question: How to use binary search to go through 2 arrays(1 is sorted the other is UNSORTED) and find the similar elements they have? You cannot
How to use binary search to go through 2 arrays(1 is sorted the other is UNSORTED) and find the similar elements they have?
- You cannot sort the unsorted array.
- You will return how many values they share in common in or under n log n time.
Please keep this code simplistic, don't use any hashes(etc), just keep it as simple as possible!!!!!
Any help is greatly appreciated :)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
