FSU Seal - 1851

COT 5405
Advanced Algorithms
Chris Lacher
Notes 2: Recurrences

Concepts


Linear Recurrences, Polynomial Method


Techniques for non-linear cases

The Master Theorem gives information about the relative asymptotic dominance of the "divide" term aT(n/b) versus the "overhead" term f(n). Note that

The master theorem has somewhat intricate hypotheses. Yet it is applicable to a sizeable portion of algorithms of the divide and conquer design, wherein a computation is reduced to a recursive call on a smaller input set plus an overhead term.