Count calls in recursive function evaluation

Q: Count calls in recursive function evaluation

This is a Software Engineering Fundamentals interview question from Bitkernel for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Software Engineering Fundamentals interview questions?

Software Engineering Fundamentals questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master software engineering fundamentals interviews.

Question

Consider the following recursive function in C-like pseudocode:

int x(int n) {
    if (n <= 3) return 1;
    else return x(n - 2) + x(n - 4) + 1;
}

When computing x(8), how many times in total is function x called (including the initial call x(8) itself)?

Count calls in recursive function evaluation

Solution

Comments (0)