In the analysis of algorithms, the master theorem provides a cookbook solution in asymptotic terms (using Big O notation) for recurrence relations of types that occur in the analysis of many divide and conquer algorithms. It was popularized by the canonical algorithms textbook Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein, in which it is both introduced and proved. Nevertheless, not all recurrence relations can be solved with the use of the master theorem; its generalizations include the Akra–Bazzi method.
Read more about Master Theorem: Introduction, Generic Form, Inadmissible Equations
Famous quotes containing the words master and/or theorem:
“Slowly ... the truth is dawning upon women, and still more slowly upon men, that woman is no stepchild of nature, no Cinderella of fate to be dowered only by fairies and the Prince; but that for her and in her, as truly as for and in man, life has wrought its great experiences, its master attainments, its supreme human revelations of the stuff of which worlds are made.”
—Anna Garlin Spencer (1851–1931)
“To insure the adoration of a theorem for any length of time, faith is not enough, a police force is needed as well.”
—Albert Camus (1913–1960)