class program { static void Main(string[] args) { int i; i = x(x(8)); } static int x(int n) { if (n <= 3) return 1; else return x(n - 2) + x(n - 4) + 1; } } 递归算法x(x(8))需要调用几次函数x(int n)? 9 12 18 24
class program { static void Main(string[] args) { int i; i = x(x(8)); } static int x(int n) { if (n <= 3) return 1; else return x(n - 2) + x(n - 4) + 1; } }
C
