CS 1321 (Principles of Algorithm Design II):
Homework #5 Sample Solution

Sample solution code

Testing

Here are the test programs we used:

• t-assignment.cc.
• t-copy-constructor.cc.
• t-minimal.cc.
• t-pop_back.cc.
• t-push_back.cc.
• t-self-assignment.cc.
• t-set.cc.
• t-sop.cc.
• t-stress.cc.

Each test program tests a particular aspect of the code. To compile and run them, compile with either your naive or powers-of-two implementation, assumed to be in a file named dynamicArray.h, and run the executable with a command-line argument of 34 (or 18000 for t-stress.cc). Output should look like the following. Also be sure to check for memory leaks using mtrace, as described in the homework writeup.

Sample output for naive implementation:

• n-t-assignment.expected-out.
• n-t-copy-constructor.expected-out.
• n-t-minimal.expected-out.
• n-t-pop_back.expected-out.
• n-t-push_back.expected-out.
• n-t-self-assignment.expected-out.
• n-t-set.expected-out.
• n-t-sop.expected-out.
• n-t-stress.expected-out.

Sample output for powers-of-2 implementation:

• p-t-assignment.expected-out.
• p-t-copy-constructor.expected-out.
• p-t-minimal.expected-out.
• p-t-pop_back.expected-out.
• p-t-push_back.expected-out.
• p-t-self-assignment.expected-out.
• p-t-set.expected-out.
• p-t-sop.expected-out.
• p-t-stress.expected-out.