called rank sort at page 80. Make a rank sort program that sorts
students by their name and print their scores along side the names in
the sorted order. Student names and scores must be included in a Student
object. The data are input through keyboard and the number of students
is flexible (use a sentinel). Analyze the best case, worst case and
average case space and time complexity of the program you made. For time
complexity, use both “counting the comparison operations” and “counting
the steps with the s/e and frequency table” approaches.
2.
Modify the program for problem 1 by replacing the sorting algorithm with
bubble sort, insert sort and selection sort. Also, you have to analyze
the best, worst and average case space and time complexity of each
version.
* The source codes, analysis results and screen shots of
your programs in working have to be prepared in a PDF file.