Tag: C++ Recursion
-
Recursion : how to change from non-tail to tail
(1) Introduce an accumulator parameter in the recursive function. Initialize the accumulator with a value that satisfies two conditions a) when the smallest value is passed from main() to the recursive function, it can correctly return the result to the main program. b) it gives the correct intermediate accumulator at the first recursive call (2)… Read more
-
Recursion: Enhance performance through Memoization and Tabulation
Memoization or memoisation is an optimization technique used in computing to accelerate program execution. It involves storing the results of costly function calls, particularly to pure functions, and retrieving the cached result when the same inputs are encountered again. By saving the outcomes of previous operations in a data structure like an array or hash… Read more
-
Tail and non-tail recursive function
The provided example showcases the reversal of digits within an integer using two different methods: non-tail recursion and tail recursion. The main() function calls the reverseDigit() function, implemented with both non-tail and tail recursive approaches. By inputting the integer 12345, the function will return the integer 54321. This example provides a clear demonstration of the… Read more
