• Textbook: Robert Sedgewick: Algorithms in C, 2nd Ed., Addison-Wesley, 1994

   


• References:
  1. Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford Stein: Introduction To Algorithms, 3rd Ed., MIT Press, 2009
  
  
• Syllabus:
  1. Fundamantals
  2. Sorting Algorithms
  3. Searching Algorithms
  4. String Processing
  5. Geometric Algorithms
  6. Graph Algorithms
  7. Advanced topics


• TAs:
  1. 蕭睆文 : Office hours: (二) 9:00--10:00,   R107;   Email: d08922001@g.ntu.edu.tw
  
  
• Handouts:
  1. Fundamentals:  algo 1.pdf
  2. Sorting Algorithms:  algo 2.pdf
  3. Searching, String, and Geometric Algorithms:  algo 3.pdf
  4. Graph Algorithms and Advanced topics:  algo 4.pdf


• Homeworks:
  1. Homework 1:   Hw1.pdf, (due day: 2/27)
  2. Homework 2:   Hw2.pdf, (due day: 3/5)
  3. Homework 3:   Hw3.pdf, (due day: 3/12)
  4. Homework 4:   Hw4.pdf, (due day: 3/26)
  5. Homework 5:   Hw5.pdf, (due day: 4/2)
  6. Homework 6:   Hw6.pdf, (due day: 4/16)