I want to know more about recursive calls since this topic is going to be in the coming final test.
I want to ask, in a single function declaration, what is the maximum number of statement that may be recursive calls? ( Since I am not too sure the meaning of a single function declaration, I assumed it is a function that has only 1 variable in parameter. I don't know about the answer should be "there is no fixed maximum" or "n, where n is the argument", but I think we can write as many as recursive calls as we want) Please correct me if I am wrong
and the maximum depth of recursive calls may make? ( This one I think it is no fixed maximum, except the memory stack runs out. But if I am wrong, please correct me)
Thank you so much, I read through the chapter of my book already, but couldn't find something related to this question