Home → Magazine Archive → November 1988 (Vol. 31, No. 11) → Using induction to design algorithms → Abstract

Using induction to design algorithms

By Udi Manber

Communications of the ACM, Vol. 31 No. 11, Pages 1300-1313
10.1145/50087.50091


Save PDF
An analogy between proving mathematical theorems and designing computer algorithms provides an elegant methodology for designing algorithms, explaining their behavior, and understanding their key ideas.

The full text of this article is premium content

0 Comments

No entries found