public class Demo {
public static void main(String[] args) {
int[] arr={5,45,1,2,45,23,3,67,6,23,12,234,456,23,123,76};
//选择法排序 效率比冒泡法高
for (int i = 0; i <arr.length; i++) {
int index=i;
for (int j = i+1; j <arr.length; j++) {
if (arr[index]>arr[j]){
index=j;
}
}
if (index!=i){
int temp;
temp=arr[i];
arr[i]=arr[index];
arr[index]=temp;
}
}
System.out.println(Arrays.toString(arr));
}
}
Java中选择排序法
猜你喜欢
转载自blog.csdn.net/weixin_45568892/article/details/102664304
今日推荐
周排行