GitHub / ndsvw / Maximum-Sum-Subarray-Python
This algorithm solves the Maximum-Sum-Subarray problem via Divide and Conquer in O(m*log(m))
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ndsvw%2FMaximum-Sum-Subarray-Python
PURL: pkg:github/ndsvw/Maximum-Sum-Subarray-Python
Stars: 0
Forks: 0
Open issues: 0
License: mit
Language: Python
Size: 1000 Bytes
Dependencies parsed at: Pending
Created at: about 6 years ago
Updated at: almost 6 years ago
Pushed at: almost 6 years ago
Last synced at: 4 months ago
Topics: algorithm, algorithms, divide-and-conquer, subarray
Loading...