Complexity Maniac
Computer Science Level pendingAgnishom gave Chris a program written in Python.
1 2 3 4 5 6 7 8 9 10 11 12 

How many ordered pair of nonnegative integers \((a,b)\) are there such that the time complexity of this recursive function is \(O(3^n)\)?
Your answer seems reasonable.
Find out if you're right!
Sign up to access problem solutions.
That seems reasonable.
Find out if you're right!
Already have an account? Log in here.