![[Bowdoin Computer Science]](bowdoin-cs-logo.small.jpg)
Homeworks
- Homework 1 [asymptotic notation] (assigned Thu 1/23, due Thu 1/30 in class)
- Homework 2 [recurrences]
(due Tue 2/11 in class)
- Homework 3 [sorting and heaps]
(assigned Wed 2/12, due Thu 2/20 in class)
- Homework 4 [selection]
(assigned Wed 2/12, due Tue 2/25 in class)
- Homework 5 [Techniques: divide
and conquer and such] (assigned wed 3/26, due Tue 4/1 in class)
- Homework 6 [Techniques: dynamic programming and greedy]
(assigned Wed 3/26, due Thu 4/3 in class) -->
- Homework 7 [programming assignment - dynamic programming] (assigned Mon 4/7, due Tue 4/15 in class)
- Homework 8 [basic graph algorithms]
(assigned Fri 4/18, due Thu 4/25 in class)
- Homework 9 [more graph algorithms]
(assigned Fri 4/25, due Tue 5/6 in class)