3 ms·
Even if Python did tail-recursion optimization, this implementation isn't tail-recursive so it would fail in the same way. This version is: def sum(li, s=
by thedufer 11y ago
Even if Python did tail-recursion optimization, this implementation isn't tail-recursive so it would fail in the same way. This version is:
def sum(li, s=0):
if len(li) == 0:
return s
else:
return sum(li[1:], li[0] + s)