Skip to main content

Induction and Recursion

  • Chapter
  • 173 Accesses

Abstract

The main purpose of this chapter is to introduce recursion. Recursion is a simple yet powerful idea that can be enormously useful in developing algorithms for solving complex problems. This is especially true if an algorithm is to be implemented in Lisp or a related programming language such as Scheme. We will also introduce the method of proof by induction, a technique closely related to recursion. In addition to being one of the standard proof techniques in mathematics, induction is a useful technique for verifying the correctness of algorithms.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Copyright information

© 1995 Peter Grossman

About this chapter

Cite this chapter

Grossman, P. (1995). Induction and Recursion. In: Discrete Mathematics for Computing. Palgrave, London. https://doi.org/10.1007/978-1-349-13908-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-13908-8_7

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-64694-6

  • Online ISBN: 978-1-349-13908-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics