A community for students. Sign up today!
Here's the question you clicked on:
 0 viewing
 3 years ago
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
 3 years ago
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

This Question is Closed

bmp
 3 years ago
Best ResponseYou've already chosen the best response.1You can do something like passing a counter as an argument (using a default value at initialization). Like this: http://codepad.org/AhHSF3nK This is just a template, there are other ways to do this.

carlsmith
 3 years ago
Best ResponseYou've already chosen the best response.0You 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)
Ask your own question
Ask a QuestionFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.