Advertisement

Recursion

  • Alexander Shen
Chapter
Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)

Abstract

Up to now, we have not use recursion in our examples. Instead we devote a special chapter to this important programming technique. Recursion can be very useful and convenient, and in some cases recursive solutions are much shorter and nicer than non-recursive ones.

We start with simple examples (section 7.1) to illustrate how recursive programs work. Then (section 7.2) we consider a class of problems where recursion is especially useful (tree processing). In section 7.3 we return to the problems considered in chapters 2 and 3 and show how they can be solved using recursion. Some other examples (topological sorting, finding connected components, etc.) are consideredin section 7.4.

Keywords

Directed Graph Outgoing Edge Recursive Call Main Program Recursive Procedure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Laboratoire d’Informatique Fondamentale de Marseille (LIF) CNRSUniversité de la Méditerranée, Université de ProvenceMarseille Cedex 13France
  2. 2.Russian Academy of SciencesInstitute for Information Transmission ProblemsMoscowRussia

Personalised recommendations