Python Challenges: 100 Proven Programming Tasks Designed to Prepare You for Anything

© The Author(s), under exclusive license to APress Media, LLC, part of Springer Nature 2022

M. IndenPython Challengeshttps://doi.org/10.1007/978-1-4842-7398-2_7

7. Advanced Recursion

Michael Inden¹  

(1)

Zurich, Switzerland

 

In this chapter, you will explore some advanced aspects around recursion. You’ll start with the optimization technique called memoization. After that, you’ll look at backtracking as a problem-solving strategy that relies on trial and error and tries out possible solutions. Although this is not optimal in terms of performance, it can keep various implementations comprehensible.

7.1 Memoization

In Chapter 3, you saw that recursion is feasible for describing many algorithms and calculations in an understandable and, at the same time, ...