Three sets are represented with three integer vectors A, B and C. The following

Question

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.

Explanation / Answer

question:

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

In worst case : A and B contains same set of elements but C contais totally different elements(not preset on A or B)

Time : O(n^3)

-Mention the improvements from first to second code

Ans: We are searching a particular element in C ONLY if it is available in A AND B

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.