Solving Recurrences and the Master Method

Lecture 9 of CS502 Fundamentals of Algorithms surveys standard mathematical techniques for solving recurrence relations arising in divide-and-conquer algorithms. The lecture details the substitution method, where an analyst guesses the asymptotic form of the solution and applies mathematical induction to prove correctness and establish constant boundaries. The iteration or unrolling method expands the recurrence iteratively until a recognizable summation series emerges. The centerpiece of the lecture is the Master Theorem, which provides a cookbook recipe for solving recurrences of the canonical form T(n) = a*T(n/b) + f(n), where a >= 1 represents the number of subproblems, b > 1 represents the subproblem shrinkage factor, and f(n) denotes the combine cost. The theorem compares f(n) against the watershed function n^(log_b a), categorizing solutions into three distinct cases: root-dominated where leaves dominate, uniformly distributed where work is balanced across all tree levels, and leaf-dominated where the root combine function dominates the overall asymptotic complexity. Algorithmic decision boundaries and lower-bound complexity proofs are evaluated alongside practical runtime performance characteristics. Graph representations are explored through adjacency matrices, adjacency lists, and memory footprint considerations in sparse and dense topologies. Breadth-first and depth-first search mechanics, discovery and finishing timestamps, and edge classifications are systematically analyzed. Greedy strategies including Huffman prefix tree generation and activity scheduling are rigorously proven using exchange arguments. Scholars examine shortest path optimality conditions, edge relaxation properties, and negative cycle detection algorithms. Minimum spanning tree algorithms including Kruskal and Prim formulations are analyzed alongside union-find disjoint set operations. Computational complexity concepts are illustrated through polynomial-time verification, decision reductions, and NP-completeness proofs. By engaging with solved past papers by Moaaz and Waqar Siddhu, learners gain actionable insights into recurrent university exam questions. Interactive quiz assessments on VU SIGMA facilitate rapid knowledge verification and retention of critical algorithmic concepts. Comprehensive coverage of standard academic benchmarks ensures learners communicate with technical precision across computational disciplines. Detailed analysis of recurrence relations highlights the imperative of analyzing base cases and recursive branching factors accurately.