In CST 370 Algorithms, we learned important data structures in computer science and acquired fundamental algorithm design techniques to get efficient solutions to several computing problems. 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.