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)?
Login required