AMCAT Practice Test
AMCAT Data Structures and Algorithms 2
What is the space complexity of a recursive Fibonacci function (without memoization)?
Select your answer
A
O(1)
B
O(n)
C
O(log n)
D
O(n²)
Hint
