COMPSCI 61A Chapter Notes - Chapter 1.7: List Of Major League Baseball Career Total Bases Leaders

• School: Berkeley
• Department: Computer Science
• Course: COMPSCI 61A
• Professor: Hilfinger Paul

Document Summary

Base cases are followed by 1+ recursive calls. A recursive function can have 1+ base cases. Base cases do not always have to come before recursive cases recursive cases - where the function calls itself with a simpler argument as part of the computation; conditional statements that are evaluated with recursive calls. Recursive calls simplify the problem incrementally recursion works because recursive functions are called with different arguments each time (no frame or environment mix up) Different frames keep track of the different arguments in each call of the recursive function. Until the return value appears, that call to the recursive function has not completed, so whatever code if under the recursive call doesn"t not get evaluated until the recursive call gets back a return value. When calling a function, you have to wait until the call receives a return value to proceed on with the code following the function call.