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:
“And his master commended the dishonest manager because he had acted shrewdly; for the children of this age are more shrewd in dealing with their own generation than are the children of light.”
—Bible: New Testament, Luke 16:8.
“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)