选择排序
package QFTest;
public class Test_06 {
public static void main(String[] args) {
int[] arr={3,2,5,4,6,1,33,22,11,33,221,6};
selectSortGood(arr);
System.out.println("优化后的选择排序算法");
for (int i : arr) {
System.out.print(i+" ");
}
}
public static void selectSort(int[] arr){
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;
}
}
}
}
public static void selectSortGood(int[] arrs){
for (int i = 0; i < arrs.length-1; i++) {
int pos=i;
for (int j = i+1; j <arrs.length ; j++) {
if (arrs[pos]>arrs[j])
pos=j;
}
if (i!=pos){
int temp=arrs[i];
arrs[i]=arrs[pos];
arrs[pos]=temp;
}
}
}
}
优化后的选择排序算法
1 2 3 4 5 6 6 11 22 33 33 221