What is the space complexity of the divide and conquer algorithm used to find the maximum sub-array sum?
O(n)
O(1)
O(n!)
O(n^{2})
(B) O(1)
Explanation:
The divide and conquer algorithm uses a constant space. So, the space complexity is O(1).
