I got a question in my algorithm class and i am unable to solve it. The question states that Theres is a Sorting Algorithm with `O(nlogn)` and searching is done by Binary search taking `O(log n)`.
Two sets are give `P` &`Q` and i have to design an algorithm to determine whether the two sets are Disjoint.