If you fail, never give up because FAIL means 'First Attempt In Learning'.— A. P. J. Abdul Kalam

Recursion — quick quiz

5 real ZIO questions on Recursion. Instant scoring and solutions, no signup — see where you stand in ~3 minutes.

Question 1 of 3

MEDIUM

What is the time complexity of the recursive Fibonacci function fib(n) = fib(n-1) + fib(n-2)?