Efficient algorithm to determine if two sets of numbers are disjoint

Question

Practicing for software developer interviews and got stuck on an algorithm question.

Given two sets of unsorted integers with array of length m and other of          


        

Answer 1

Here's a link to a post that I think answers your question.

3) Sort smaller O((m + n)logm)

1. Say, m < n, sort A
2. Binary search for each element of B into A

Disadvantage: Modifies the input