Stock Market Problem

Below is Java code that implements three different solutions for the Stock Market problem:

• A brute force solution: BruteForce.java
• An iterative solution: Iterative.java
• A recursive divide-and-conquer solution: Recursive.html

The Stock Market problem can be transformed into an instance of the Maximum Subarray Sum problem. Below is Java code that implements a brute force and a divide-and-conquer solution for the Maximum Subarray Sum problem:

• A brute force solution: BruteForceTransform.java
• A recursive divide-and-conquer solution: Transformation.java

The remaining Java classes are necessary if you would like to run any of the solutions:

• StockIfc.java
• StockInfo.java