| Date | Topic | First Edition | Second Edition |
| January 6 | Course overview | --- | --- |
| January 8
. |
Course overview
Introduction |
Chapter 1 |
Chapter 2 |
| January 13 | Introduction | ||
| January 15
. |
Introduction
Math review |
Section 2.2 |
Section 3.2 |
| January 27 | Asymptotic notation | Section 2.1 | Section 3.1 |
| January 29
. |
Asymptotic notation
Recurrences |
Sections 4.1-4.3 |
Sections 4.1-4.3 |
| February 3
. |
Recurrences
Heap-Sort |
Chapter 7 |
Chapter 6 |
| February 5 | Heap-Sort | ||
| February 10
. |
Heap-Sort
Quick-Sort |
Sections 8.1-8.3 |
Sections 7.1-7.3 |
| February 12 | EXAM 1 | --- | --- |
| February 17 | Quick-Sort | ||
| February 19
. |
Quick-Sort
Counting-Sort |
Section 9.2 |
Section 8.2 |
| February 24
. . |
Counting-Sort
Radix-Sort Binary search trees |
Section 9.3 Sections 13.1-13.3 |
Section 8.3 Sections 12.1-12.3 |
| February 26 | Binary search trees | ||
| March 3
. |
Binary search trees
Disjoint sets |
Sections 22.1-22.3 |
Sections 21.1-21.3 |
| March 5 | Disjoint sets | ||
| March 17 | Disjoint sets | ||
| March 19
. |
Representing graphs
Breadth-first search |
Section 23.1
Section 23.2 |
Section 22.1
Section 22.2 |
| March 24
. |
Breadth-first search
Depth-first search |
Section 23.3 |
Section 22.3 |
| March 26 | EXAM 2 | --- | --- |
| March 31 | Depth-first search | ||
| April 2
. |
Topological sort
Spanning trees |
Section 23.4
Chapter 24 |
Section 22.4
Chapter 23 |
| April 7
. |
Spanning trees
Greedy algorithms |
Sections 17.1 and 17.2 |
Sections 16.1 and 16.2 |
| April 9 | Greedy algorithms | ||
| April 14
. |
Greedy algorithms
NP problems |
Section 36.2 |
Section 34.2 |
| April 16 | NP problems | ||
| April 21
. |
NP problems
Examples of NP |
Section 36.5 |
Section 34.5 |
| April 23 | FINAL EXAM | --- | --- |