计算n!(整数n≥0)的递归算法是：int Factorial(int n){if(n= =o)return l；else returnn*Factorial(n--1)；}其时闯复杂度为
A.0(n) B.0(log2n) C.O(n0) D.O(n2)正确答案A
计算n!(整数n≥0)的递归算法是：int Factorial(int n){if(n= =o)return l；else returnn*Factorial(n--1)；}其时闯复杂度为
A.0(n) B.0(log2n) C.O(n0) D.O(n2)正确答案A
