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

question:

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

-Mention the improvements from first to second code

1Returns 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 groupA) 4 for (int b groupB) for (int c groupC) if ((a-b) && (b-c)) return false; // we found a common value 8 return true; // if we reach this, sets are disjoint Algorithm disjoint1 for testing three-way set disjointness