Problem: Maintain a dynamic collection of pairwise-disjoint sets= {S1, S2, .. S } Each set S; has one element distinguished as the representative element, rep[]
The analysis of merge sort fromLecture 1 required us to solve arecurrence. Recurrences are like solving integrals,differential equations, etc.o Learn a few tricks