Find the maximum subarray using divide and conquer. 

The algorithm calculates the subarray with the largest sum. If all numbers are positive or negative then the maximum subarray will be the entire array. There is an extra file called "Tuple.java", it simply implements the functionality of tuples which I used in the solution.