BigO of recursive functions (II)
Computer Science Level 21 2 3 4 5 6 

The function Fibonacci(N)
, given above, runs in ______________.
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.