• anonymous
Problem set 3: recursion. Does anyone know how to operate a counter in a recursive function? Normally I'd use: counter=0 blah blah counter=counter+1 However in a recursive function this would reset the counter to zero. I can return a +1, but I'd prefer to return a total. Any ideas? - thanks
MIT 6.00 Intro Computer Science (OCW)
  • Stacey Warren - Expert
Hey! We 've verified this expert answer for you, click below to unlock the details :)
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
  • schrodinger
I got my questions answered at in under 10 minutes. Go to now for free help!
  • anonymous
You can do something like passing a counter as an argument (using a default value at initialization). Like this: This is just a template, there are other ways to do this.
  • anonymous
  • carlsmith
You can increment a global variable with the global keyword. You will often increment or decrement the variable by passing an appropriate expression in the recursive call, i.e. def f(n): if n == 2: return 2 else: return n * f(n - 1) f(52)

Looking for something else?

Not the answer you are looking for? Search for more explanations.