Master theorem (analysis of algorithms)
id:
master-theorem-analysis-of-algorithms-170-9524368
title:
Master theorem (analysis of algorithms)
text:
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. The approach was first presented by Jon Bentley, Dorothea Blostein, and James B. Saxe in 1980, where it was described as a "unifying method" for solving such recurrences. The name "master theorem" was popularized by the widely-used algorithms textbook Introduction to Algorithms by Cormen, Le
brand slug:
wiki
category slug:
encyclopedia
description:
Tool for analyzing divide-and-conquer algorithms
original url:
https://en.wikipedia.org/wiki/Master_theorem_(analysis_of_algorithms)
date created:
2004-03-29T05:21:49Z
date modified:
2024-08-31T23:55:30Z
main entity:
{"identifier":"Q922367","url":"https://www.wikidata.org/entity/Q922367"}
image:
fields total:
13
integrity:
15