reduce versus recursion? what am I missing...
cfelling at iae.nl
Sat Apr 15 02:29:59 CEST 2000
Warren Postma <embed at geocities.com> wrote:
> # I am trying to figure out why function d (recursive) and e (reduce)
> # DON'T do the SAME thing:
> def d(*tup):
> "why doesn't this work?"
> if len(tup)>1:
> return d(tup[1:])+abs(tup-tup)
Wel to start with, why not use a loop?
r = 0 # mind you, you 'seeded' the reduce with 0!
for t in tup:
r = abs(r-t)
You see fast, clear and crisp and no surprises here:)
But if you insist on recursion...
# don't forget the 'seed' value for the recursive 'reduce'
print "why, it works!",
return d(0, tup)
def dd(r, tup):
# return d(tup[1:])+abs(tup-tup)
return dd(abs(r-tup), tup[1:])
More information about the Python-list