Master theorem

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Notion

Domain

Science and technology

In collections

Nobody has pulled it yet.

What Wikipedia says

In the analysis of algorithms, the master theorem for divide-and-conquer recurrences provides an asymptotic analysis for many recurrence relations that occur in the analysis of divide-and-conquer algorithms.

Excerpt from the Wikipedia article “Master theorem (analysis of algorithms)”, under the CC BY-SA 4.0 license. Read the article on Wikipedia