Q155
What is the space complexity of the divide and conquer algorithm used to find the maximum sub-array sum?
A.
O(n)
B.
O(1)
AnswerC.
O(n!)
D.
O(n2)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board