anonymous
  • anonymous
IS THERE A WAY TO COUNT THE NUMBER OF RECURSIVE STEPS IN A RECURSION PROGRAM
MIT 6.00 Intro Computer Science (OCW)
schrodinger
  • schrodinger
See more answers at brainly.com
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.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this
and thousands of other questions

anonymous
  • anonymous
You can add a global variable, like count = 0, then incrementing it by 1 every time you call the function (like at the beginning of the function). Or, somewhat better, passing some counting variable, like count, as another argument, and set the default to 0. See this: http://codepad.org/WRPMlGvq
anonymous
  • anonymous
Try to input the function into a other function. and you have def a(): counter+=1 def b(): actual function or make a class. and for each call of the instance the counter get +1. i hope it answered you question.

Looking for something else?

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