Mathematical Structures for Computer Science
Mathematical Structures for Computer Science
Discrete Mathematics and Its Applications
Discrete Mathematics and Its Applications
| Hi-index | 0.00 |
Mathematical induction is a proof technique used throughout math-ematics, and recursion is a programming concept frequently used in computer science. This note will explore the parallel between induction proofs and recursive programs by providing several example problems that lead to an induction proof and a corresponding recursive program. We feel that students who are exposed to this parallel will gain a deeper understanding of both topics.