Career Tracks
Exams
MCQ
Companies
Opportunities
Pricing
MCQ Practice
Programming
Time & Space Complexity
Question
Medium
tcs-nqt
What is the space complexity of a recursive Fibonacci function without memoisation?
A
O(1)
B
O(n)
C
O(log n)
D
O(2^n)
Show Answer
← Back to Time & Space Complexity questions
What is the space complexity of a recursive Fibonacci function without memoisation? | Time & Space Complexity MCQ | TomoLink | TomoLink
