This page is part of my personal academic record, not an official course website.

Course description

Design/analysis of algorithms and data structures; divide-and-conquer; sorting and selection, search trees, hashing, graph algorithms, string matching; probabilistic analysis; randomized algorithms; NP-completeness.

Textbooks and resources

Required textbook

  • Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, 3rd edition, 2009, The MIT Press

Back to Undergraduate Studies