Recursion

Analytica User GuideProcedural ProgrammingRecursion

A recursive function is a function that calls itself within its definition. Those new to recursion may find this a bit strange. Experienced programmers know its often the simplest way to define a function, and sometimes the only way. As an example, consider this definition of factorial:

Function Factorial2(n: Positive Atom)

Definition: IF n <= 1 THEN 1 ELSE n*Factorial2(n - 1)

If the parameter, n, is greater than 1, Factorial2 calls itself with the actual parameter value n - 1. Otherwise, it simply returns 1. Like any recursive function, it has a termination condition to tell it when to stop recursion — in this case, when n <= 1.

Tip

The built-in function Factorial does the same, and is fully abstractable, to boot. We define Factorial2 here as a simple example to demonstrate key ideas.

Normally, when you try to use a function in its own definition, it complains about a cyclic dependency loop with an error message like this:

. To enable recursion, you must display and set the Recursive attribute:

Select Attributes from the Object menu.
Select Functions from the Class menu.
Scroll down the list of attributes and click Recursive twice, so that it shows √, meaning that the recursive attribute is displayed for each function in its Object window and the Attribute panel.
Check OK to close Attributes dialog.

For each function for which you wish to enable recursion:

Open the Object window for the function by double-clicking its node (or selecting the node and clicking the Object button).

Type 1 into its Recursive field.

As another example, consider this recursive function to compute a list of the prime factors of an integer, x, equal to or greater than y:

Function Prime_factors(x, y: Positive Atom)

Definition:

Var n := Floor(x/y);

IF n < y THEN [x]

ELSE IF x = n*y THEN Concat([y], Factors(n, y))

ELSE Prime_factors(x, y + 1)

Factors(60, 2) → [2, 2, 3, 5]

In essence, Prime_factors says to compute n as x divided by y, rounded down. If y is greater than n, then x is the last factor, so return x as a list. If x is an exact factor of y, then concatenate x with any factors of n, equal or greater than n. Otherwise, try y + 1 as a factor.

Tip

To prevent accidental infinite recursion, it stops and gives a warning if the stack reaches a depth of 256 function calls.

Recursion

See also