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.
- Check whether an array can be made strictly decreasing by modifying at most one element
- Construct the Rooted tree by using start and finish time of its DFS traversal
- Rearrange numbers in an array such that no two adjacent numbers are same
- Merge two BSTs with constant extra space
- Largest sub-string where all the characters appear at least K times
- Longest prefix in a string with highest frequency
- Convert given integer X to the form 2^N - 1
- Data Structures and Algorithms Online Courses : Free and Paid
- Sorting Algorithms Visualization : Bubble Sort
- Complexity Analysis of Binary Search