一维数组的冒泡排序与逆转

1、一维数组的冒泡排序

public class demo01 {
    public static void main(String[] args) {
        int[] a={1,22,3,2,55,6,77,8};
        for (int i=0;i<a.length;i++){
            for (int j=0;j<a.length-1;j++){
                if (a[j]>a[j+1]){
                    int temp=a[j];
                    a[j]=a[j+1];
                    a[j+1]=temp;
                }
            }
        }
        //遍历
        for (int  i=0;i<a.length;i++){
            System.out.print(a[i]+"\t");
        }
    }
}

2、逆转

public class demo02 {
    public static void main(String[] args) {
        int[] a={1,22,3,2,55,6,77,8};
        for (int i=0;i<a.length/2;i++){
            int temp=a[i];
            a[i]=a[a.length-i-1];
            a[a.length-i-1]=temp;
        }
        for (int  i=0;i<a.length;i++){
            System.out.print(a[i]+"\t");
        }
    }
}