Also do I need recursion for any of the pset3 solutions? If yes any good sources on recursion. There was a quick example in lecture 3. Will that suffice? Preferably a video. I realize I could just google a video but if anyone knows of any decent ones than tell me.



You don't need to use recursion in pset3, although you could use it for binary search if you'd like. Here's the official CS50 short on Recursion

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .