We have discussed (in tail recursion) that a recursive function is tail recursive if recursive call is the last thing executed by the function.
We also discussed that a tail recursive is better than non-tail recursive as tail-recursion can be optimized by modern compilers. Modern compiler basically do tail call elimination to optimize the tail recursive code.
If we take a closer look at above function, we can remove the last call with goto. Below are examples of tail call elimination.
The above function can be replaced by following after tail call elimination.
Therefore job for compilers is to identify tail recursion, add a label at the beginning and update parameter(s) at the end followed by adding last goto statement.
This article is contributed by Dheeraj Jain. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
- QuickSort Tail Call Optimization (Reducing worst case space to Log n )
- Tail Recursion
- Tail Recursion for Fibonacci
- Tail recursion to calculate sum of array elements.
- Maximum sum path in a Matrix
- Find all the possible mappings of characters in a sorted order
- Arrange numbers to form a valid sequence
- Find smallest number with given number of digits and sum of digits under given constraints
- Find the maximum range [L,R] whose sum is divisible by M
- Minimum Cost Graph
- Count of different groups using Graph
- Number of pairs of arrays (A, B) such that A is ascending, B is descending and A[i] ≤ B[i]
- Difference Between Flood-fill and Boundary-fill Algorithm
- Check if one string can be converted to another