Number of recursive function calls

Question

Number of recursive function calls

Navigation

#1 by (0 votes)

1

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));
}

c

asked by anonymous 01.10.2018 / 19:27

1 answer

Textarea characters break line when submitting to database CSS for SASS convert or not? [closed]

score 0 · Answer 1

It's easy, you can create a variable to count this:

int qtd = 0;

int fibonacci(int n) {
    qtd += 1;
    printf("chamado: %d \n", qtd);
    if ((n == 1) || (n == 2))
        return (1);
    return (fibonacci(n-1) + fibonacci(n-2));
}

Tested on online_c_compiler