Career Tracks
Exams
MCQ
Companies
Opportunities
Challenges
Pricing
MCQ Practice
Data Structures
Recursion & Backtracking
Question
Medium
tcs-nqt
What is the time complexity of computing Fibonacci(n) recursively (without memoisation)?
A
O(n)
B
O(n log n)
C
O(2^n)
D
O(n²)
Show Answer
← Back to Recursion & Backtracking questions
What is the time complexity of computing Fibonacci(n) recursively (without memoisation)? | Recursion & Backtracking MCQ | TomoLink | TomoLink
