This algorithm solves the Maximum-Sum-Subarray problem via Divide and Conquer in O(m*log(m))
-
Updated
Jun 19, 2019 - Python
This algorithm solves the Maximum-Sum-Subarray problem via Divide and Conquer in O(m*log(m))
It finds the maximum sum of a continuous subarray in a given array of integers.
30 Days of Code Challenge
Add a description, image, and links to the subarray topic page so that developers can more easily learn about it.
To associate your repository with the subarray topic, visit your repo's landing page and select "manage topics."