On the Solution of Linear Recurrence Equations

  • Mohamad Akra
  • Louay Bazzi


In this article, we present a general solution for linear divide-and-conquer recurrences of the form
$$u_n = \sum\limits_{i = 1}^k {a_i u} $$
$$\frac{n}{{b_i }}$$
⌋ + g(n) Our approach handles more cases than the Master method does {1}. We achieve this advantage by defining a new transform - the Order transform - which has useful properties for providing asymptotic answers (compared to other transforms which supply exact answers). This transform helps in mapping the sequence under consideration to the two dimensional plane where the solution becomes easier to obtain. We demonstrate the power of the final results by solving many “difficult” examples.
Divide and conquer Linear recurrence Running time Algorithm Order transform Order of growth 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J.L. Bently, D. Haken, and J.B. Saxe. A general method for solving divide-and-conquer recurrences. SIGACT News, 12(3):6–44, 1980.Google Scholar
  2. 2.
    T. Cormen, C.Leiserson and R. Rivest. Introduction to Algorithms. McGraw-Hill, 1990, Chapter 4.Google Scholar
  3. 3.
    Donald E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, 1968. Second edition, 1973.Google Scholar
  4. 4.
    C. L. Liu. Introduction to Combinatorial Mathematics. McGraw-Hill, 1968.Google Scholar
  5. 5.
    Paul W. Purdom, Jr., and Cynthia A. Brown. The Analysis of Algorithms. Holt, Rinehart, and Winston, 1985.Google Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Mohamad Akra
    • 1
  • Louay Bazzi
    • 1
  1. 1.Department of Electrical and Computer EngineeringAmerican University of BeirutBeirutLebanon

Personalised recommendations