Projects from class
- The Cloth-cutting Problem.
- Given a large, rectangular piece of cloth (dimension: X by Y)
- Known a list of cloth products i with their dimension (xi by yi) and prices (pi)
- Cut the cloth into products while maxmize its value
- Unscrambles anagrams to word(s) of the dictionary
- Implementation of Prim's algorithm and the MST-walk algorithm
- Approximately solve the Euclidean Traveling Salesman Problem
- Finding longest common subsequence between two given strings