How to trace recursive functions in Capgemini pseudocode questions, with three worked examples for n = 5 and the traps to watch for.
Interview Insights and Technical Explorations
How to trace recursive functions in Capgemini pseudocode questions, with three worked examples for n = 5 and the traps to watch for.
Print the Fibonacci series with a loop, a recursive version, why plain recursion is exponential, and how memoisation fixes it.