What is the time complexity of the divide and conquer algorithm used to find the maximum sub-array sum?
Posted: Wed Jul 13, 2022 7:40 pm
a) O(n)
b) O(logn)
c) O(nlogn)
d) O(n2)
b) O(logn)
c) O(nlogn)
d) O(n2)
Accurate answers. Every time.
https://answerhappy.com/