7
Master Method Design and Analysis of Algorithms I Motivatio n
Master Method
Design and Analysis of Algorithms I
Motivation
Integer Multiplication Revisited
A Recursive Algorithm
A Recursive Algorithm
A Better Recursive Algorithm
𝑇 (𝑛 )≤2𝑇 (𝑛/2)+𝑂 (𝑛2)3𝑇 (𝑛/2)+𝑂 (𝑛)4𝑇 (𝑛/2)+𝑂 (𝑛)4𝑇 (𝑛/2)+𝑂 (𝑛2)
Which recurrence best describes the running time of Gauss’s algorithm for integer multiplication?
Tim Roughgarden
A Better Recursive Algorithm
