Android复习之冒泡排序

先上代码

package tests;
public class text{
    public static void main(String []args){
        int []ints = {1,3,2,7,5,4,6};
        sort(ints);
    }
    public static void sort(int []ints){
        for(int i = 0;i < ints.length-1;i++){//外层for循环的变量i用于控制内层排序范围，ints.length-1=排序次数
            for(int j = 0;j < ints.length-1-i;j++){//内层for循环用于通过两两比较，将范围内最大元素置于最右边，ints.length-1-i = 遍历数组元素的最大下标
                if(ints[j] > ints[j+1]){ 
                    int a = ints[j];
                    ints[j] = ints[j+1];
                    ints[j+1] = a;
                }
            }
        }
        for(int i = 0;i < ints.length;i++){//
            System.out.println(ints[i]);
        }
    }
}

完了

转载于:https://www.cnblogs.com/liuzhongqi/p/5436283.html