The document discusses different methods for solving recurrence equations: 1. Substitution method involves guessing a solution and using induction to prove it is correct. 2. Iterative method expands the recurrence into a summation and evaluates it. 3. Master method handles recurrences of the form T(n)=aT(n/b)+f(n). It provides 3 cases to bound the solution. 4. Recursion tree method models the recurrence as a tree to track problem sizes and costs at each level. Summing costs across levels provides the total solution.