Correctness of an algorithm for three-way disjointness problem
The problem is to decide if three nonempty sets of integers, represented as three arrays A, B and C (Python lists in the code below), have empty intersection.
The problem is to decide if three nonempty sets of integers, represented as three arrays A, B and C (Python lists in the code below), have empty intersection.