Go over the homework.

Some solutions that I wrote for the homework back in 2015 are in the hw mar2 folder. Both of these are more elaborate than I'd expect you to do, but they both show the sorts of issues you can explore with these ideas.

The hash table example we coded during class is attached.

Start discussing the sorting algorithms listed in the text ... see if you can put together a table describing them with entries like

The midterm assignment is posted. It's due date listed is Friday before the break, but it's OK if you turn it in after breack ... as long as it is in *before* our first class after the break. Work coming in after that will get a lower grade.

http://cs.marlboro.edu/ courses/ spring2017/algorithms/ notes/ Mar_2
last modified Thursday March 2 2017 11:26 am EST

name last modified size

---

hash.py Mar 2 2017 11:26 am 2.31kB