Hello. How would you know how many times a function is called recursively by your code?
For example, in the code below, how do you know how many asterisks the function prints for a given value n?
int fibonacci(int n) {
printf("*");
if ((n == 1) || (n == 2))
return (1);
return (fibonacci(n-1) + fibonacci(n-2));
}