https://github.com/ndsvw/maximum-sum-subarray-python
This algorithm solves the Maximum-Sum-Subarray problem via Divide and Conquer in O(m*log(m))
https://github.com/ndsvw/maximum-sum-subarray-python
algorithm algorithms divide-and-conquer subarray
Last synced: 8 days ago
JSON representation
This algorithm solves the Maximum-Sum-Subarray problem via Divide and Conquer in O(m*log(m))
- Host: GitHub
- URL: https://github.com/ndsvw/maximum-sum-subarray-python
- Owner: ndsvw
- License: mit
- Created: 2019-06-02T17:13:28.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2019-06-19T22:08:35.000Z (over 6 years ago)
- Last Synced: 2025-01-14T02:25:59.926Z (11 months ago)
- Topics: algorithm, algorithms, divide-and-conquer, subarray
- Language: Python
- Homepage:
- Size: 1000 Bytes
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0