Algorithms

Catalog description

This course introduces several broad algorithmic approaches to solving problems, many interesting and practical algorithms within several problem domains, and formal and empirical methods of assessing the computational complexity of algorithms. The following topics in this course will be covered: union-find and dynamic connectivity, bottom-up merge sort, graph implementations and their repercussions on various graph algorithms, and many more. Students will learn to compare algorithmic approaches, both empirically (by timing, or tracking primitive operations) and formally. A significant part of this course involves actually writing or understanding programs that implement the above topics, for homework and on exams. Prerequisite(s): COM 1320 .