class Jdxzpx{
public static void main(String[] args) {
int [] arr = {7,3,5,3,4,7,2};
int len = arr.length;
for (int i = 0;i< len;i++ ) {
//look for the min 的索引
int min = i;
for(int j =i+1;j<len;j++){
if(arr[min]>arr[j]){
min = j;
}
}
if(min!=i){reverse(arr,min,i);}
}
for (int i =0;i<len ;i++ ) {
System.out.print(arr[i]);
}
}
public static void reverse(int [] arr,int i,int j){
int temp = arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
快速选择排序
最新推荐文章于 2022-11-08 22:24:45 发布