for A recursive algorithm must have a This is some condition which, if satisfied, is often a simple version of the problem that can be solved directly. This stops the algorithm from ever. A recursive algorithm must call and the values of local variables and arguments are recorded on the on each of these calls. A recursive algorithm must change its in such a way that it moves towards the base case, by the problem in some way. unwinding reducing recursing program Python increasing heap iterating base case itself algorithm call stack state transforming a friend stack case memory list