Problem statement: Give two sets A and B, devise and algorithm that checks if A and B are disjoint. The following information are given about the set A and B:
- |A| = |B| = n, that is number of elements in both sets are n
- A and B are not necessairly sorted
- All elements in A and B range from [[TEX]0[/TEX],[TEX]n^c[/TEX]] for some constant
- You can use O(n) space.
Ask questions if you need to or send me a Private message