Recursion

  • Niklaus Wirth

Abstract

Procedures may not only be called, but can call procedures themselves. Since any procedure that is visible can be called, a procedure may call itself. This self-reactivation is called recursion. Its use is appropriate when an algorithm is recursively defined and in particular when applied to a recursively defined data structure.

Keywords

Cardi 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Niklaus Wirth
    • 1
  1. 1.Institut für InformatikETHZürichGermany

Personalised recommendations