Class work for Algorithms class Project 1: Maximum subarray problem with divide and conquer and recursion. Project 2: Make Change with greedy algorithms and dynamic programing Project 3: (TSP) travelling salesman problem. Implimented using nearest neighbor.