1.算法思想：依次取一个数与后面的数逐个做比较，较大（小）的用交换位置的方法后置
2.选择排序代码实现
import java.util.Arrays;
public class xuanze {
public static void main(String[] args) {
int[] arr = {5, 3, 2, 4, 1};
for (int i = 0; i < arr.length - 1; i++) {//控制循环次数 拿出比较基数
for (int j = i + 1; j < arr.length; j++) {//基数与后面比较次数
if (arr[i] < arr[j]) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
} System.out.println(Arrays.toString(arr));
}
}
3.选择排序优化代码import java.util.Arrays;
public class xuanze {
public static void main(String[] args) {
int[] arr = {5, 3, 2, 4, 1};
for (int i = 0; i < arr.length - 1; i++) {//控制循环次数 拿出与后面做比较的基数
for (int j = i + 1; j < arr.length; j++) {//基数与后面比较次数
if (arr[i] < arr[j]) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
} else if (arr[i] < arr[j]&&arr[i] < arr[j + 1]) {
int temp = arr[i];
arr[i] = arr[j + 1];
arr[j + 1] = temp;
} else if (arr[i] < arr[j]&&arr[i] < arr[j + 1]&&arr[i] < arr[j + 2]) {
int temp = arr[i];
arr[i] = arr[j + 2];
arr[j + 2] = temp;
} else if (arr[i] < arr[j]&&arr[i] < arr[j + 1]&&arr[i] < arr[j + 2]&&arr[i] < arr[j + 3]) {
int temp = arr[i];
arr[i] = arr[j + 3];
arr[j + 3] = temp;
}
}
} System.out.println(Arrays.toString(arr));
}
}
