The Stock Market problem can be transformed into an instance of the Subset Sum Problem. The Subset Sum problem takes an array of integers and returns the non-empty, contiguous subset with the greatest sum. Below is Java code for solving the Subset Sum problem using a brute force solution and a divide-and-conquer solution. You can run the tester class to time each method and see how the "running time" grows as the input size grows.