Recursion

AP Computer Science A· difficulty 4/5

Memoization improves recursive Fibonacci to

A
$O(2ⁿ) \to O(n) by caching results$
check_circle
B
$Doesn't help$
C
$O(log n)$
D
$Same$

Explanation

Cache fib(k) once computed; each value computed once.

Want 10 more like this — adaptive to your weak spots?

Practice 10 like thisarrow_forward Predict my AP score

Related questions

auto_awesomeAll Tools question_answerHomework Q&A menu_bookAP & SAT Prep timelineLearn Mode