What is the space complexity of the divide and conquer algorithm used to find the maximum sub-array sum?
|Answer» B. o(1)|
|Explanation: the divide and conquer algorithm uses a constant space. so, the space complexity is o(1).|
Login to Continue
It will take less than 2 minutes