Arrays类讲解。冒泡排序

int[] a = {1,2,3,456,453,12312,45};
System.out.println(a);//[I@1b6d3586
//打印数组元素//Arrays.toString(a)
//System.out.println(Arrays.toString(a));
//printArray(a);
Arrays.sort(a);//数组进行排序:升序
System.out.println(Arrays.toString(a));


int[] a = {1,2,45,6,3,8,345,54754,45};
int[] sort = sort(a);
System.out.println(Arrays.toString(sort));
}
//冒泡排序
public static int[] sort(int[] array) {
//临时变量
int temp = 0;
//外层循环,判断要走多少次;
for (int i = 0; i < array.length; i++) {
boolean flag = false;//通过flag标识位减少没有意义的比较
//内层循环,比较判断两个数,如果第一个数比第二个大,则交换位置
for (int j = 0; j < array.length-1-i; j++) {
if (array[j+1]>array[j]){//降序,< 为升序
temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
flag = true;
}
}
if (flag==false){
break;
}
}
return array;
java
浙公网安备 33010602011771号