Ask your own question, for FREE!
MIT 6.00 Intro Computer Science (OCW) 17 Online
OpenStudy (anonymous):

pset 3 #1 i managed to make the iterative program, but how do i make the recursive program?

OpenStudy (anonymous):

and just to clarify: iterative involves a while loop, and recursive contains a command within a function to repeat that function again?

OpenStudy (anonymous):

What I did for pset 3a recursive was I used find on the first line and on the second I did return if x!=-1 and your function with the arguments target[x+1:],key and then add 1 to keep track of how many times it found it. That is not correct syntax thats just to put you on right track. The target[x+1:] is so that the next function will start at the position after the last found solution and go to the end.

OpenStudy (anonymous):

ok i did it, but it involves a global variable which im afraid breaks the rules of it being strictly recursive.

OpenStudy (anonymous):

i just don't get how you have a counter in a recursive function, because you have to set it to zero in the beginning, right? and if its recursive, it will reset itself to zero every time.

OpenStudy (anonymous):

Sorry wrong attachment: heres the right one

OpenStudy (anonymous):

never mind got it

OpenStudy (anonymous):

Hey can you post your final code?

OpenStudy (anonymous):

OpenStudy (anonymous):

Ok cool here is what I did. Idk which is "better" but mine is shorter. http://dpaste.com/hold/529915/

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!
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!