CST 370 - Design and Analysis of Algorithms

CST 370 - Design and Analysis of Algorithms

Students learn important data structures in computer science and acquire fundamental algorithm design techniques to get the efficient solutions to several computing problems from various disciplines. Topics include the analysis of algorithm efficiency, hash, heap, graph, tree, sorting and searching, brute force, divide-and-conquer, decrease-and-conquer, transform-and-conquer, dynamic programming, and greedy programming.

Sample Work

Please note that this class primarily included assignments however, I am proud of implementing some of these algorithms when I participated in MIT's battlecode competition. Algorithms like; FIFO, Djikstra's and A*

You can find a link to the source files here: https://github.com/swordensen/battlecode24