Worst-Case Analysis of Running Time for UNION-FIND using Path-Compressed Up-Trees

Main points:

(a) A simple technique may require a complex analysis method.

(b) Ackermann’s function has an application.

(c) Amortized analysis is a novel way to account for the running time of an algorithm.

(d) UNION-FIND with path-compressed up-trees is highly efficient.

Previous slide

Next slide

Back to first slide

View graphic version