java数组排序

1冒泡排序

public class demo {
    public static void main(String[] args) {
        int[] a={9,8,3,4,6,7,5,1,2};
        for (int i = 0; i < a.length-1; i++) {
            for (int j = 0; j <a.length-i-1 ; j++) {
                if(a[j+1]<a[j]){
                    int temp= a[j];
                    a[j]=a[j+1];
                    a[j+1]=temp;
                }
            }
        }
        for (int j : a) {
            System.out.print(j+" ");
        }
    }
}

2 选择排序

public class demo {
    public static void main(String[] args) {
        int[] a={9,8,3,4,6,7,5,1,2};
        for (int i = 1; i < a.length; i++) {
            int index=0;
            for (int j = 1; j <a.length-i +1; j++) {
                if(a[index]>a[j]){
                    int temp= a[a.length-i];
                    a[a.length-i]=a[index];
                    a[index]=temp;
                }else {
                    index=j;
                }
            }
        }
        for (int j : a) {
            System.out.print(j+" ");
        }
    }
}

3 插入排序

public class demo {
    public static void main(String[] args) {
        int[] a={9,8,3,4,6,7,5,1,2};
        int j;
        for (int i = 1; i < a.length; i++) {
           int temp=a[i];
            for (j = i-1; j >=0&&a[j]>temp; j--) {
                   a[j+1]=a[j];
               }
               a[j+1]=temp;


        }
        for (int n : a) {
            System.out.print(n+" ");
        }
    }
}