选择排序就是每次选择剩余所有数中最小或者最小的数与当前位置的数进行交换。
package suanfa;
import java.util.Arrays;
import java.util.Scanner;import java.util.concurrent.CountDownLatch;
public class Main {
public static void main (String[] args) {
int[] arr = {4,2,3,5,3};
int[] arr1 = {1,2,3,4,5};
selectionSort(arr);
System.out.println(Arrays.toString(arr));
}
public static void selectionSort(int[] arr) {
if(arr == null || arr.length <2) {
return;
}
int minIndex;
for(int i=0;i < arr.length-1;i++) {
minIndex =i;
for(int j=i+1;j<arr.length;j++) {
minIndex = arr[minIndex] > arr[j] ? j : minIndex;
}
swap(arr, minIndex, i);
}
}
public static void swap(int[] arr, int i,int j) {
arr[i] = arr[i]^arr[j];
arr[j] = arr[i]^arr[j];
arr[i] = arr[i]^arr[j];
}
}