CMSC398L

Covers most of the basic techniques and algorithms that are used in competitive programming. Topics include C++ STL, greedy, dynamic programming, divide and conquer, graph algorithms, and data structures. Students will learn different algorithmic techniques and apply these concepts to solve interesting programming problems in practice. A student-led course through Student-Initiated Courses (STICs) @ UMD: http://stics.umd.edu/ Please click here for more information.