Advertisement

Recursion

  • Richard J. Gaylord
  • Samuel N. Kamin
  • Paul R. Wellin

Abstract

A function is defined using recursion if in its definition, it makes calls to itself. Though this sounds like a ‘circular definition’, the use of recursion in Mathematica is perfectly legal and extremely useful. In fact, many of the built-in operations of Mathematica could be written in Mathematica itself using recursion. In this chapter, we will present many examples of recursion and explain how recursive functions are written.

Keywords

Dynamic Programming Binary Tree Symbolic Computation Recursive Function Gaussian Elimination 
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 New York 1993

Authors and Affiliations

  • Richard J. Gaylord
    • 1
  • Samuel N. Kamin
    • 2
  • Paul R. Wellin
    • 3
  1. 1.Dept. of Materials ScienceUniversity of IllinoisUrbanaUSA
  2. 2.Dept. of Computer ScienceUniversity of IllinoisUrbanaUSA
  3. 3.Dept. of MathematicsCalifornia State UniversityRohnert ParkUSA

Personalised recommendations