The example program 'sortrace' runs
a race between two different implementations
of a sorter: the Eiffel/S class SORTER,
which uses the bottom up heapsort algorithm,
and the class QSORTER, which uses the
quicksort algorithm.

It reads an arbitrarily long list of strings 
from an ASCII file and puts them
into two arrays. Then it sorts the
first array using QSORTER and the second
using SORTER.

One can either specify the name of the
ASCII file on the command line or
let 'sortrace' ask for the name of
the file.

Compile with:
     ecc -O sortrace

Run with:
     sortrace filename

or
     sortrace

"filename" should be an ASCII file with one word per line.
To produce a file suitable to use as "filename"
one can take an arbitrary text file "my_file" and
send it through the following pipeline:

   cat my_file | tr -sc "[A-Z][a-z]" "[\012*]" >filename


