Question: If the recursion depth of an algorithm is n, its space complexity is at least O a. O(n) b. O(log(n)) Oc. O(nlog(n)) O d. O(n)

If the recursion depth of an algorithm is n, its space complexity is at least O a. O(n) b. O(log(n)) Oc. O(nlog(n)) O d. O(n)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
