8
Master Method Proof (Part II) Design and Analysis of Algorithms I
Master Method
Proof (Part II)Design and Analysis
of Algorithms I
Tim Roughgarden
The Story So Far/Case 1Total work: (*)
Tim Roughgarden
Basic Sums Fact
Tim Roughgarden
Case 2Total work: (*)
Tim Roughgarden
Case 3Total work: (*)
The number of levels of the recursion tree.
The number of nodes of the recursion tree.
The number of edges of the recursion tree.
The number of leaves of the recursion tree.
Which of the following quantities is equal to ?
Tim Roughgarden
Case 3 continuedTotal work: (*)
Tim Roughgarden
The Master MethodIf then if (Case 1) if (Case 2) if (Case 3)
