In a recursive function, what is the maximum number of recursive calls allowed?
n (where n is a parameter passed to the function)If it is only one, how can we implement something like Fibonacci function?
It can not be a fixed number, as it depends on the application.