public class SelectionSorter {

//Returns the index of the largest element in the arrayOfIntegers, beginning from the fromIndex.

public static Integer[] selectSort(Integer[] incoming) {

Integer[] ret = new Integer[incoming.length];

for (int i = 0; i < incoming.length; i++) {

ret[i] = incoming[i];

}

int temp = 0;

for (int i = 0; i < ret.length - 1; i++) {

if (ret[i] > ret[i + 1]) {

temp = ret[i];

ret[i] = ret[i + 1];

ret[i + 1] = temp;

i = -1;

}

}

return ret;

}

//Returns a sorted (from smallest to largest) copy of the incoming array of Integers. Uses the classic selection sort

//algorithm.

public static Integer[] selectSortReverse(Integer[] incoming) {

throw new UnsupportedOperationException("you must implement this method");

}

//Return the index of the smallest element in the arrayOfInts, beginning the search fromIndex;

public static int findMin(int fromIndex, Integer[] arrayOfInts) {

throw new UnsupportedOperationException("you must implement this method");

}