Design and Analysis of Algorithms
Description
I learned about important data structures in computer science and acquired fundamental algorithm design techniques to develop efficient solutions to various computing problems from different disciplines. Topics included 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.
Algorithms
Much of my knowledge of algorithms and data structures came from this class. Here are a few programs I wrote implementing some of the concepts taught in class.