recursion: function

1 2 3 4 5 6

1. Introduction
2. Tree
3. Function
4. Correspondence
5. Cache
6. Rephrase

The function we ended up with is show below.

def n_paths(start=1, end=5, jumps=(1, 2)):
    if start > end:
        return 0
    if start == end:
        return 1
    return npaths(start=start + 1, end=end) + npaths(start=start + 2, end=end)