数组的高级选择排序
2019-03-23 / JAVA / 973 次围观 / 0 次吐槽 /原理:第一个数依次跟后面的数比较,小的放前面
Java
int[] arr = {24,69,80,57,13};
//比较的轮数
for(int i=0;i<arr.length - 1;i++){
System.out.println("第" + (i+1) + "轮比较");
for(int j = i + 1 ; j < arr.length;j++ ){
System.out.println(i + "=" + j);
//对换位置
if(arr[i] > arr[j]){
int tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
}
}
Powered By Cheug's Blog
Copyright Cheug Rights Reserved.