简单选择排序

1 思想：循环进行比较选择出最小的或则最大的那个数进行交换。

2 代码：

/** * 简单选择排序 * @param src */private static <T extends Comparable<T>> void selectSort(T[] src) {int length = src.length;for (int i = 0; i < length; i++) {int position = i;for (int j = i + 1; j < length; j++) {int compare = src[j].compareTo(src[position]);if (compare < 0) {position = j;}}if (position != i) {T temp = src[i];src[i] = src[position];src[position] = temp;}}}