We first analyzed the "basic" union/find algorithm. The class was led to suggest something equivalent to union by rank, and we analyzed it. I described collapsing finds and then stated a bound on the running time of the data structure when both optimizations are used. There were a few minutes of general discussion on amortized time bounds. (I had imagined to get further in the discussion of amortized analysis.)