• Guest, before posting your code please take these rules into consideration:
    • It is required to use our BBCode feature to display your code. While within the editor click < / > or >_ and place your code within the BB Code prompt. This helps others with finding a solution by making it easier to read and easier to copy.
    • You can also use markdown to share your code. When using markdown your code will be automatically converted to BBCode. For help with markdown check out the markdown guide.
    • Don't share a wall of code. All we want is the problem area, the code related to your issue.

    To learn more about how to use our BBCode feature, please click here.

    Thank you, Code Forum.

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

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]
        return 0
Top Bottom