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.
- Dixon's Factorization Method with implementation
- Detect Cycle in a Linked List using Map
- Longest sub-array of Prime Numbers using Segmented Sieve
- Number of integers in a range [L, R] which are divisible by exactly K of it's digits
- Wheel Factorization Algorithm
- Finding powers of any number P in N!
- Longest common subarray in the given two arrays
- Minimum removals required to make ranges non-overlapping
- Minimum Enclosing Circle | Set 1
- Longest increasing sub-sequence formed by concatenating array to itself N times