algo master1
Post on 09-Apr-2016
237 Views
Preview:
DESCRIPTION
Algorithm Master
TRANSCRIPT
𝑇 (𝑛 )≤2𝑇 (𝑛/2)+𝑂 (𝑛2)3𝑇 (𝑛/2)+𝑂 (𝑛)4𝑇 (𝑛/2)+𝑂 (𝑛)4𝑇 (𝑛/2)+𝑂 (𝑛2)
Which recurrence best describes the running time of Gauss’s algorithm for integer multiplication?
top related