This repositary includes 4 projects for Duke ECE590 - Algorithm.
All of the projects are developed under pipenv and the Pipfile is provided. To set up the environment, simply execute:
pipenv install
This will install required packages for all the four projects under pipenv.
Link: ece590_project1
In this project, we implemented the following 5 different sorting algorithms.
- Selection Sort
- Insertion Sort
- Bubble Sort
- Merge Sort
- Quick Sort
Link: ece590_project2
In this project, we implemented both DFS and BFS to solve several different mazes.
Link: ece590_project3
In this project, we implemented Bellman-Ford to detect arbitrage opportunities given a set of exchange rates between currencies.
Link: ece590_project4
In this project, we implemented both Prim’s and Kruskal’s algorithms for finding a Minimum Spanning Tree. We then use that MST to approximate the solution for the Traveling Salesman Problem.
- Shu Yu Lee - Initial work - jimmyshuyulee
- Fang Feng - Initial work - FangFeng-077