冒泡排序。。

i:总共需要几轮：数组长度-1

j:每轮比较几次：数组长度减i

 

public class test {
    public static void main(String[] args) {
        int[] a={2,5,7,1};
        for (int i = 1; i <=a.length-1; i++) {
            for (int j = 0; j < a.length- i; j++) {
                if(a[j]>a[j+1]){
                a[j]=a[j]+a[j+1];
                a[j+1]=a[j]-a[j+1];
                a[j]=a[j]-a[j+1];
            }}
        }
        for (int i = 0; i < a.length; i++) {
            out.println(a[i]);

        }
    }
}

public class test {
    public static void main(String[] args) {
        int[] a={2,5,7,1};
        for (int i = 1; i <a.length-1; i++) {
            for (int j = 0; j < a.length- i-1; j++) {
                if(a[j]>a[j+1]){
                a[j]=a[j]+a[j+1];
                a[j+1]=a[j]-a[j+1];
                a[j]=a[j]-a[j+1];
            }}
        }
        for (int i = 0; i < a.length; i++) {
            out.println(a[i]);

        }
    }
}