Worst-Case Analysis of Running Time for UNION-FIND using Path-Compressed Up-Trees
(a) A simple technique may require a complex analysis method.
(b) Ackermann’s function has an application.
(c) UNION-FIND with path-compressed up-trees is highly efficient.
Note: Amortized analysis is a novel way to account for the running time of an algorithm, but it is beyond the scope of the course.