Question: Given two arrays of n integers each, describe an O(n log(n)) algorithm for determining whether they have an element in common.
Given two arrays of n integers each, describe an O(n log(n)) algorithm for determining whether they have an element in common.
Step by Step Solution
3.57 Rating (168 Votes )
There are 3 Steps involved in it
You want to know the common elements between 2 arrays This is the simplest solution ... View full answer
Get step-by-step solutions from verified subject matter experts
