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.
- What are Hash Functions and How to choose a good Hash Function?
- The Role of Algorithms in Computing
- Van Emde Boas Tree - Set 3 | Successor and Predecessor
- Percentage increase in the volume of cuboid if length, breadth and height are increased by fixed percentages
- Square free semiprimes in a given range using C++ STL
- Pre-Order Successor of all nodes in Binary Search Tree
- Find the maximum cost path from the bottom-left corner to the top-right corner
- Proizvolov's Identity
- Iterative program to generate distinct Permutations of a String
- Find maximum meetings in one room