GitHub repository: m4ta1l/Max-Subarray
Description: The maximum subarray problem is the task of finding the contiguous subarray within a one-dimensional array, a[1...n], of numbers which has the largest sum. This script solves the max subarray problem via divide-and-conquer with O(nlogn)  time complexity.