Career Tracks
Exams
MCQ
Companies
Opportunities
Pricing
MCQ Practice
Data Structures
Dynamic Programming
Question
Medium
What is the time complexity of the naive recursive Fibonacci solution?
A
O(n)
B
O(n log n)
C
O(2^n)
D
O(n²)
Show Answer
← Back to Dynamic Programming questions
What is the time complexity of the naive recursive Fibonacci solution? | Dynamic Programming MCQ | TomoLink | TomoLink
