What is recursion and when should I use it?

recursion  Recursion by definition is actually very straight forward It is simply when a function calls itself Now you may think this would always result Recursion implicitly uses a stack Hence all recursive approaches can be rewritten iteratively using a stack Beware of cases where the

Recursion is a powerful technique that helps us bridge the gap between complex problems Recursion occurs when the definition of a concept or process depends on a simpler or previous version of itself Recursion is used in a variety of disciplines

In the previous chapters, we went through the concept and the principles of recursion As a reminder, here is the general workflow to solve a recursion problem: In programming terms, recursion is a function calling itself until a base condition is true to produce the correct output In other words, to solve a problem,