What is the time complexity of the divide and conquer algorithm used to find the – 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 time complexity of the divide and conquer algorithm used to find the maximum sub-array sum?

Subject: ComputerTopic: Dynamic Programming In Data Structures

A

O(n)

B

O(logn)

C

O(nlogn)

D

O(n 2 )

Correct Answer: C

Practice Quiz Back to MCQs