>>88に追加です。
>>88をrobot, home, Stage, Mainの４つのクラスに分けて作れ。

Add a score keeper for your game, and record the top n scores in a file.
Implement three sorting algorithms to sort these scores.
(Only one sorting algorithm needs to be in place by your program due date.
The other two will be used in the analysis.)
Two of the algorithms may be an elementary sorting algorithm, such as: insertion sort, selection sort, bubble sort.
One of the algorithms must be an efficient sorting algorithm, such as: the quick sort, the shell sort, the heap sort, the merge sort, or the radix sort.
You may choose which list structure to use for the scores, such as your own array or linked list, or an ArrayList or a LinkedList.

To implement sorting of the scores:
The score data type will need a method to compare objects. Typically this involves a compareTo() method as well as an equals() method (use the Comparable Interface).
Duplicate scores are allowed in your list.
Use file input and output to store the scores.
Use exception handling for file errors.