Agnishom 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)\)?
Problem Loading...
Note Loading...
Set Loading...