Editing Akra–Bazzi method (section)

== Significance ==
The Akra–Bazzi method is more useful than most other techniques for determining asymptotic behavior because it covers such a wide variety of cases.  Its primary application is the approximation of the running time of many divide-and-conquer algorithms.  For example, in the [[merge sort]], the number of comparisons required in the worst case, which is roughly proportional to its runtime, is given recursively as <math>T(1) = 0</math> and

:<math>T(n) = T\left(\left\lfloor \frac{1}{2} n \right\rfloor \right) + T\left(\left\lceil \frac{1}{2} n \right\rceil \right) + n - 1</math>

for integers <math>n > 0</math>, and can thus be computed using the Akra–Bazzi method to be <math>\Theta(n \log n)</math>.