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.
- Find the kth element in the series generated by the given N ranges
- Dudeney Numbers
- Find minimum positive integer x such that a(x^2) + b(x) + c >= k
- Check whether N is a Dihedral Prime Number or not
- Minimum possible final health of the last monster in a game
- Delete odd and even numbers at alternate step such that sum of remaining elements is minimized
- Minimum sub-array such that number of 1's in concatenation of binary representation of its elements is at least K
- Total number of triangles formed when there are H horizontal and V vertical lines
- Travelling Salesman Problem implementation using BackTracking
- Divide array into two parts with equal sum according to the given constraints