in-place selection sort

Rearrange an unordered ArrayList<Integer> and use it as the data in an OrderedList_inArraySlots.

The re-use is probably contrary to Java's conventions for its built-in classes. But as a pedagogical tool, it has the advantage of allowing the User program to check that the sort is done in-place.

count the cost

  1. If the number of the elements in the input triples, the time required to run the reigning champ algorithm will grow by three times. Triple the amount of comparisons will be made. [Justify, in about 2 sentences.]

  2. If the number of the elements in the input triples, the number of times that the reigning champ algorithm will be invoked will grow by three times. Triple the amount of comparisons will be made. [Justify, in about 2 sentences.]

  3. If the number of the elements in the input triples, the time required for the selection sort will grow by __________________. [Justify, in about 2 sentences.]