Design and analysis of algorithms for computational problems. Course topics includes widely applicable algorithms (sorting/searching, graph, etc.), common algorithmic design approaches (greedy, divide and conquer, dynamic programming, etc.), analysis (complexity analysis, NP completeness, and undecidability), and approximation algorithms.
