Editing Akra–Bazzi method (section)

{{short description|Method in computer science}}
In [[computer science]], the '''Akra–Bazzi method''', or '''Akra–Bazzi theorem''', is used to analyze the asymptotic behavior of the mathematical [[Recurrence relation|recurrences]] that appear in the [[Analysis of algorithms|analysis]] of [[Divide-and-conquer algorithm|divide and conquer algorithms]] where the sub-problems have substantially different  sizes. It is a generalization of the [[master theorem (analysis of algorithms)|master theorem for divide-and-conquer recurrences]], which assumes that the sub-problems have equal size. It is named after mathematicians Mohamad Akra and Louay Bazzi.<ref name=":0" />