Due Date: November 9

NO LATE SUBMISSIONS.


Write a program that reads a file containing words,
one word to a line, and outputs another file that contains the
words in sorted order.

You may assume that all words are lower case.
Use an apvector<apstring> to represent the words.
Use the sorting algorithm in Section 9.5 (although it
is written for ints, it will work for apstring, if you
make appropriate minor changes).
Alternatively, use the algorithm described in class.

You may declare the apvector with capacity of 500; however,
once you have read everything, you should use resize to shrink the
apvector to exactly match the number of items read.
For a few points extra credit, start with a small size, and double
capacity as necessary.

HINT: The code for the textbook is online.
    
HAND IN: Your source code and program output.
  Use the file data7.txt, which is on the Web page.

The due date is Monday, November 9 at CLASS TIME
and there will be a quiz at the start of class
concerning vectors. You may be asked to write
a sorting algorithm.