package 选择排序;
public class SelectionSort {
public static void main(String[] args) {
int[] arr = {5, 3, 6, 8, 1, 7, 9, 4, 2};
for (int i = 0; i < arr.length - 1; i++) {//待比较:注意边界
int minPos = i;
for (int j = i + 1; j < arr.length; j++)//用于比较
{
minPos = arr[j] < arr[minPos] ? j : minPos;//更新最小值下标
}
System.out.println(“minPos:” + minPos);
swap(arr, i, minPos);//更新最小值
System.out.println(“经过第” + i + “次循环之后,数组的内容:”);
printArray(arr);
}
}
public static void swap(int[] arr, int i, int j) {//用于数组中交换俩个数的函数
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
public static void printArray(int[] arr) {//数组遍历
System.out.print("{");
for (int i = 0; i < arr.length; i++) {
if (i == arr.length - 1) {
System.out.print(arr[i]);
} else {
System.out.print(arr[i] + ", ");
}
}
System.out.print("}");
}
}
//这里是截图