Multiple recursion
Multiple recursion is recursion in which one invocation makes more than one recursive call.
Modern C, Third Edition
Multiple recursion is recursion in which one invocation makes more than one recursive call.
- How it is used
- Analyzes branching recursive algorithms through Fibonacci and their execution-time consequences.
- How deep it goes
- Derives exponential and linear execution-time behavior, then stops short of concrete timing measurements.
- Examples
- Uses fib(n), the fib(4) call tree, and cached Fibonacci implementations as concrete examples.
- What you can do after
- Evaluate recursive algorithm costs and apply caching to reduce repeated Fibonacci computation.
Read how Modern C, Third Edition explains multiple recursion →
Modern C
Multiple recursion is recursion in which one invocation makes more than one recursive call.
- How it is used
- Uses Fibonacci to expose duplicated subproblems and motivate algorithmic improvement.
- How deep it goes
- Explains call duplication and exponential versus linear time, but defers implementation details and concrete timing measurements.
- Examples
- Uses fib(n), the fib(4) call tree, cached Fibonacci code, and timing exercises.
- What you can do after
- Evaluate recursive performance and apply caching to eliminate repeated subproblem computation.
Related concepts
- exponential time complexityproduces · Exponential time complexity is a computational growth rate in which an algorithm’s running time increases exponentially with input size.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.