Three sets are represented with three integer vectors A, B, and C. The following agorithm calculates three-way set disjointness. In easier terms the problem is to determine if the intersection of three sets is empty.

- Assume the size of each set to be n.

-Identify the worst-case scenario.

-Calculate the worst-case running time in asymptotic notation.

1/** Returns true if there is no element common to all three arrays. 2 public static boolean disjoint1(int ] groupA, int groupB, int ] groupC) for (int a 3 for (int a groupA) for (int b : groupB) for (int c groupC) if ((a-b) && (b-c)) // we found a common value / if we reach this, sets are disjoint return false; 8 return true; Algorithm disjoint1 for testing three-way set disjointness