Java系列-排序算法之选择排序

public static void main(String[] args) {
//the original array
int[] arrSource = {10, 3, 4, 7, 22, 456};
//sort the array
selectedSort(arrSource);
//print the elements of array
for (int element : arrSource
) {
System.out.println(element);
}
}

private static void selectedSort(int[] arrSource) {
//ifn, return
if (arrSource == null || arrSource.length == 0) {
return;
}
//record the index of Mimimum
int minIndex = 0;
//sorted array
for (int i = 0; i < arrSource.length - 1; i++) {
minIndex = i;
for (int j = i + 1; j < arrSource.length; j++) {
//if arrSource[i] > arrSource[j], record the index of arrSource[j]
if (arrSource[minIndex] > arrSource[j]) {
minIndex = j;
}
}
//if the mimimum is not the initial value, then swap them
if (i != minIndex) {
swap(arrSource, i, minIndex);
}
}
}

private static void swap(int[] arr, int i, int i1) {
int temp = arr[i];
arr[i] = arr[i1];
arr[i1] = temp;
}