• As always, make sure your code is clear and well-commented.

  • As always, mail a copy of your source code (as attachments if possible) to c373@ms.washington.edu. Make sure to send us all of your source code. We will be compiling your code and linking it to a Sparse Array ADT code (such as add.cpp, but different). This should be effortless for us. If we have to mail you to get missing files, we will be grumpy. (note: only .c, .cpp, and .h files are necessary. Do not mail us a copy of your entire executable or any sample input/output, for example).

  • Turn in a cover sheet for your code printout that contains:

      (a) the normal "directory" of what code each file you're giving us contains

      (b) a (very brief) description of what implementation you chose (a small sketch of your ADT with a few sentences would be the clearest thing)

      (c) how your implementation differs from your original proposal (did you make any improvements, did you have to cut any corners)? If your implementation differs from the original in such a way that the asymptotic space or running times differ from those reported in your proposal, please specify them here.

      (d) any known problems in your implementation (better for you to admit to them than for us to find them)

      (e) anything else about your program that you think is interesting or worth mentioning.

  • Include a sample code that uses your Sparse Array and its output. I'm assuming that you'll write some test cases for your code beyond the basic add.cpp file (since it doesn't test all the operations). You don't have to include every single one, but you should include one that demonstrates that your implementation is working.

  • Also, turn in a copy of your complete source code. Please make the sparse array header file the first file (so we can find it quickly) and the main sparse array code file the second file in your packet.