a) O(1)
b) O(n)
c) O(n2)
d) O(n3)
The time complexity of the following recursive implementation to find the factorial of a number is ________ advertisemen
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
The time complexity of the following recursive implementation to find the factorial of a number is ________ advertisemen
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!