CPS 104 (Ramm)
                     Fall Semester 1995
                   Homework Assignment #3


Due Friday, Sep. 22

Write a program to go through a list of three character
strings (stored as words: the fourth character is the null
termination to the string) and display each on the screen.
The list of words (strings) should be terminated by a word
containing the value zero (all null characters).  The
program should not depend on any other clue for the length
of the list.

Next have your program do a ``bubble type'' sort on this
list of strings.  Keep it as simple as possible.  Don`t
worry about run-time efficiency.  Programmer time is also
important.  This sort should treat the strings as unsigned
integers!  Note the sltu instruction.

Display the list of words in their new order.

For test data, make up a list of three letter words.  It
should include about 12 words.  Clearly, zero (all nulls) is
not a valid data value for this problem.  Your program
should work for any reasonably sized list of words.  Make
sure that your test data actually shows that your program is
working reasonably.  Selection of reasonable test data is
part of this assignment.  Use of unreasonable data (data
that does not exercise the features of your program) can
result in the loss of points.


This is probably as good a time as any to begin using
conservative program implementation methods.  Don't enter a
whole program in assembler and then try to debug it.
Generally, use top-down implementation techniques.  However,
I recommend that you segment the process even further and
write only a portion of your program (favoring output
portions) and get it working. Then add another section or
flesh out some part, building the program a step at a time.
For example, your first attempt at this program should do
nothing more than list the words on the screen.













                     September 15, 1995