What is the space complexity of the recursive implementation used to find the nt – OfficerPath

Latest Jobs CSS 2025 PMS CCE Sindh FPSC PPSC MCQs Past Papers Current Affairs Scholarships Admissions Downloads Roll No. Slips Results

MCQ Practice

What is the space complexity of the recursive implementation used to find the nth fibonacci term?

Subject: ComputerTopic: Dynamic Programming In Data Structures

A

O(1)

B

O(n)

C

O(n 2 )

D

O(n 3 )

Correct Answer: A

Practice Quiz Back to MCQs