Please make sure that you are aware of our Collaboration Policy, as any violations will be taken seriously.

Click to see details about computer accounts or about how to submit your source code and readme file when complete.

Make sure that you are aware of our Late Policy. On this note, we want to make sure that you realize that these assignments will require a good deal of time. The final source code may not be that long but creating and debugging the code is a serious time commitment. Also please note that precepts are scheduled for Mondays and Tuesdays, however it would be a mistake to wait until after precept to start your assignments. You may be able to ask far more meaningful questions in precept if you already have worked on the program enough to know what the real difficult issues are.

Finally, a note about the readme file which you must turn in each week. Besides any problem specific information which is listed in each week's assignment or checklist, you should use this file to give the reader a high-level explanation of your source code and point to any thing unusual or notable about your program (such as extra credit or known bugs).

The following is a checklist which provides a summary of the assignment. This is meant only as a supplement; please read the original assignment description.

When we talk about the "number of comparisons" we specifically are interested in times when you compare one key to another key (we didn't intend to have you account for every time a line of your code does an exchange, for instance in loop controls).

Below we say: "Make sure that a pass of your h-sort does not use more than a constant amount of auxiliary space or more than a constant times N time. (Note: h does not count as a constant...this is too much)." Note, your h-sort may do many passes. We are not requiring that your overall h-sort run in O(N) time.