Q243
What is the time complexity of the divide and conquer algorithm used to find the maximum sub-array sum?
A.
O(n)
B.
O(logn)
C.
O(nlogn)
AnswerD.
O(n2)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board