Question: Suppose we implement partial path compression on find(i) by making every other node on the path from i to the root link to its grandparent
Suppose we implement partial path compression on find(i) by making every other node on the path from i to the root link to its grandparent (where this makes sense). This is known as path halving.
a. Write a procedure to do this.
b. Prove that if path halving is performed on the finds and either union-by-height or union-by-size is used, the worst-case running time is O(Mα(M,N)).
Step by Step Solution
3.43 Rating (159 Votes )
There are 3 Steps involved in it
This is most conveniently implemented without recursion and is faster ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
1486-C-S-A(456).docx
120 KBs Word File
