Multiple-Size Divide-and-Conquer Recurrences

01/15/2001

∙

by   Ming-Yang Kao, et al.

∙

0

∙

share

This short note reports a master theorem on tight asymptotic solutions to divide-and-conquer recurrences with more than one recursive term: for example, T(n) = 1/4 T(n/16) + 1/3 T(3n/5) + 4 T(n/100) + 10 T(n/300) + n^2.