Ask
your own question, for FREE!
MIT 6.00 Intro Computer Science (OCW)
14 Online
problemset 3 problem 1 recursive i dont understand how do to this problem because it seems paradoxical, you must define a count at 0, but when you go back to the base case, the program resets the count. could someone explain an alternative way for this problem or a way around this? my code: http://dpaste.com/718101/
Still Need Help?
Join the QuestionCove community and study together with friends!
For the first problem, you can pass a hidden argument to the recursive function and it will count okay, check: http://codepad.org/aTGMRw3n There is a minor catch in writing the code this way, see if you can solve it. Are you having other problems understanding the problem set? :-)
Can't find your answer?
Make a FREE account and ask your own questions, OR help others and earn volunteer hours!
Join our real-time social learning platform and learn together with your friends!
Join our real-time social learning platform and learn together with your friends!
Latest Questions
serenitystXrgazer:
Getting sent to anti gay christian covestion camp in a few weeks, any tips. guys i think im cooked.
Aubree:
Guys, what does love feel like? I've been getting a tight chest and when I talk to him my heart rate hangs out around 100-120 beats per min, and when he doe
thereneelg:
ok... anyone have advice?? ...I did Choir all throughout Middle school and have ALWAYS been put in Soprano those three years.
kamariana:
The Byzantine Procopius is known for (5 points) reconquering much of the old Roma
chuckD:
hellp!!! what does it mean to describe a scientist as skeptical Why is sceptical
DoltonCarlee:
So like do y'all know anything about the first world war?
thehearken:
anyone know how to explain this so its easier for me to understand? b(1)=2, b(n)=
8 minutes ago
0 Replies
0 Medals
4 hours ago
10 Replies
2 Medals
2 days ago
6 Replies
1 Medal
3 days ago
0 Replies
0 Medals
3 days ago
2 Replies
1 Medal
2 days ago
2 Replies
0 Medals
2 days ago
5 Replies
2 Medals