Stock Market Problem and Maximum Subarray 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

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: BruteForce.java
• A recursive divide-and-conquer solution: Recursive.java
• The remaining Java classes are necessary if you would like to run any of the solutions:
  • SubsetIfc.java
  • SubsetInfo.java
  • SubsetTester.java