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.
KeywordsDynamic Programming Binary Tree Symbolic Computation Recursive Function Gaussian Elimination
Unable to display preview. Download preview PDF.