medium10 pts · first answer countssorting-and-searching

Maximum subarray by divide and conquer

The divide-and-conquer solution to maximum subarray sum checks the best in the left half, the right half, and one crossing the middle. How does it compare with Kadane's algorithm?

A.It is O(n), Kadane's is O(n log n)B.It is O(n log n), Kadane's is O(n)C.Both are O(n^2)D.It is O(log n), Kadane's is O(n)

Discussion 0

Join free to post in the discussion.

Maximum subarray by divide and conquer

Discussion 0

Related questions