This means each recursive call processes a list of size one less than the previous list.

This means each recursive call processes a list of half the size.

This way the function identifier is used for recursive calls and as result holder.

The second problem was a crash with recursive web-worker calls.

The cost to set up the recursive call stack frame.

The cost to multiply the result of the recursive call to by n.

In some languages, a direct recursive call is not allowed.

After the recursive call the clause of the present node is updated.

In practice, graph isomorphism testing is used to avoid some recursive calls.

For the recursive calls, new and next are modified using functions new1, next1, and new2 that were defined in the above table.