Ask your own question, for FREE!
Computer Science
kekeman:

What is the base case of a recursion? A condition that prevents a recursive call to the function A condition that results in a recursive call to the function The starting value of the variable used to control the recursion The values of the function variables just before the first recursive call to the function

Laylalyssa:

do you have any idea right now

Laylalyssa:

or like a guess

kekeman:

I was thinking either A or C

Laylalyssa:

Yeah I think A as well A definition i found said "The base case is a way to return without making a recursive call. In other words, it is the mechanism that stops this process of ever more recursive calls and an ever growing stack of function calls waiting on the return of other function calls." From this site right here ~ https://www.usna.edu/Users/cs/choi/ic210/lec/l26/lec.html#:~:text=The%20base%20case%20is%20a,return%20of%20other%20function%20calls. "The base case is a way to return without making a recursive call" That basically restated the first answer choice, so i believe A is our answer

kekeman:

Ok thank you

Laylalyssa:

@kekeman wrote:
Ok thank you
you're welcome

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!