Held: Friday, 25 April 2003
Summary: Today we ground our understanding of the insertion sort algorithm by experimenting with it in a laboratory setting.
the hardest problem we solved, 2 minutes of Q&A.
Thursday, 16 January 2003 [Samuel A. Rebelsky]
Thursday, 24 April 2003 [Samuel A. Rebelsky]
I usually create these pages
on the fly, which means that I rarely
proofread them and they may contain bad grammar and incorrect details.
It also means that I tend to update them regularly (see the history for
more details). Feel free to contact me with any suggestions for changes.
This document was generated by
Siteweaver on Tue May 6 09:30:20 2003.
The source to the document was last modified on Thu Apr 24 20:58:36 2003.
This document may be found at