The night before the exam, sleep. A rested mind recalls what a tired one has only read.

Recursion — quick quiz

3 ZIO-pattern questions on Recursion. Instant scoring and solutions, no signup — see where you stand in a few minutes.

Question 1 of 3

Medium

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