Maximum sum subarray problem using brute force, divide & conquer and dynamic programming
-
Updated
Oct 11, 2022 - Jupyter Notebook
Maximum sum subarray problem using brute force, divide & conquer and dynamic programming
Prof. Jungmin So - fall '23
Basic algorithm and Datastructres
Implement maximum sum of subarray for the given scenario of resource allocation using the divide and conquer approach.
The solution to the popular maximum sum sub-array problem has been provided using the Dynamic Programming approach.
Add a description, image, and links to the maximum-sum-subarray topic page so that developers can more easily learn about it.
To associate your repository with the maximum-sum-subarray topic, visit your repo's landing page and select "manage topics."