CIS 71 (section 1): Homework 11
Handed out: 4/15/97
Due: by 2:30pm on 4/22/97
Email program to btrianta@thunder.temple.edu
This homework is very similar to homework 10, but there are a number
of differences:
- When you read strings from the unsorted.dat file, before putting
them in the table array, trim each string by removing leading
and trailing spaces.
- When you sort the table, treat all characters as if they were
lowercase [i.e. if you are comparing two rows, say x and y, copy
x and y to new strings, say z and w, put into lowercase
z and w, then compare the resulting z and w].
- When performing binary search again do not pay attention to the cases
of the strings [i.e. again compare copies that have been put into
lowercase].
As a comment at the beginning of your program you should do a case
analysis for this problem: problem statement, analysis, design,
implementation, and testing.