Summer 2018
Course Description

This course presents an introduction to the techniques for designing efficient computer algorithms and analyzing their running times. General topics include asymptotics, solving summations and recurrences, algorithm design techniques, analysis of data structures, and introduction to NP-completeness.
Course Information


  • Clyde Kruskal (, Office 3215 AV Williams

Class Time / Venue

  • M-F 9:30am - 10:55am @ CSI 3117


Textbook (on reserve at McKeldin Library)

  • Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009). Introduction to Algorithms (3rd ed.). MIT Press (Any edition is fine)

Supplementary Book


  • Midterm: Wednesday, June 27, 8:45am
  • Final: Friday, July 6, 8:45am


Office Hours
    • Clyde Kruskal: Every day: 11:00am-12:00pm
    • TA's: Monday, Tuesday, Wednesday, Thursday: 2:00pm-5:00pm
    • Peter Sutor (, Shuhao Tan (