Aptitude
Reasoning
Verbal
Technical
AI
Exams
Search
Technical
/
Programming Concepts
/
Exercises
/
Exercise 3
Programming Concepts
medium
0/15 answered
Q1
What is the space complexity of recursive Fibonacci without memoization?
A
O(n) due to call stack
B
O(log n) due to binary recursion
C
O(1) as it uses no extra space
D
O(n^2) due to repeated calculations
← Prev
1 / 15
Next →
← Exercise 2
Exercise 3 of 7
Exercise 4 →