JAVA Question 3: This question refers to the specific implementation given in th

Question

JAVA

Question 3: This question refers to the specific implementation given in the text.

In this coding, when there is a tie, the first argument to union is always the champion. Note that this is different from the previous two questions.

Using WEIGHTED QUICK UNION (no path compression): What is the contents of the id[] array after running
quick-union on the following sequence, where 9-0 represents a call to uf.union(9,0).

9-0 3-4 5-8 7-2 2-1 5-7 0-3 4-2

Question 3 options:

      i: 0 1 2 3 4 5 6 7 8 9  id[i]: 9 7 7 9 3 7 6 7 5 7  

      i: 0 1 2 3 4 5 6 7 8 9  id[i]: 4 2 2 4 2 8 6 2 2 0  

      i: 0 1 2 3 4 5 6 7 8 9  id[i]: 9 9 9 9 9 9 6 9 9 9  

      i: 0 1 2 3 4 5 6 7 8 9  id[i]: 4 1 1 4 1 8 6 2 1 0  

      i: 0 1 2 3 4 5 6 7 8 9  id[i]: 9 7 7 9 3 9 6 5 5 9  

      i: 0 1 2 3 4 5 6 7 8 9  id[i]: 1 1 1 1 1 1 6 1 1 1  

Explanation / Answer

Answer is option 1:

i:        0 1 2 3 4 5 6 7 8 9
id[i]:    9 7 7 9 3 7 6 7 5 7

THE TREE LOOKS LIKE THIS;

Related Questions

Navigate

• Browse (All)
• Browse J
• Subjects

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