![[Bowdoin Computer Science]](bowdoin-cs-logo.small.jpg)
Homeworks
- Homework 1 [asymptotic notation] (assigned Tue 9/10, due Tue 9/17 in class)
- Homework 2 [recurrences]
(assigned Wed 9/18, due Tue 9/24 in class)
- Homework 3 [sorting and heaps]
(assigned Wed 9/25, due Tue 10/1 in class)
- Homework 4 [selection]
(assigned Fri 10/4, due Thu 10/10 in class)
- Homework 5 [divide and conquer]
(assigned Thu 10/17, due Tue 10/22 in class)
- Homework 6 [dynamic programming]
(assigned Thu 10/24, due Thu 10/31 in class)
- Homework 7 [dynamic programming
and greedy]
(assigned Thu 10/24, due Tue 11/5 in class)
- Homework 8 [basic graph algorithms]
(assigned Fri 11/15, due Thu 11/21 in class)
- Homework 9 [more graph algorithms]
(assigned Mon 12/2, due Tue 12/10 in class)