每次循环找数组当中最小的值,放在有序数组中的第i位
代码:
import java.util.Arrays;
public class SearchSort {
public static void main(String[] args) {
int[] arr = new int[]{5,7,4,2,0,1,3,6};
searchSort(arr);
}
public static void searchSort(int[] arr) {
for (int i = 0; i < arr.length-1; i++) {
int minIndex = i;
int min = arr[i];
//找出最小值
for (int j = i+1; j < arr.length; j++) {
if (min>arr[j]) {
min = arr[j];
minIndex = j;
}
}
//数据交换
arr[minIndex] = arr[i];
arr[i] = min;
}
System.out.println(Arrays.toString(arr));
}
}