Python how is this done?

[Deleted member 1940]

Implement a function called walker(x) that, given a list x of N numbers [x(0), x(1), x(2),..., x(N-1)], outputs a "walk list" y = [y(0), y(1),..., y(N)], defined recursively as:
y(0) = 0,
y(n) = y(n-1) + x(n-1), if 0 < n <= N

 

[LTomy]

Hello,

This is not really a question, but rather asking us to do it for you... Don't you know Python? Have you tried?

N = [1, 2, 3, 4]

def walker(n):
    if(0 < n and n <= len(N))
        return walker(n-1) + N[n-1]
    else
        return 0