选择排序和冒泡排序算法

 //冒泡排序算法
    @Test
    public void sort2(){
        int [] array={1,34,4,56,67,7,89};
        for (int i = 0; i < array.length-1; i++) {
            for (int j = 0; j < array.length-i-1; j++) {
                if(array[j]>array[j+1]){
                    int temp=array[j];
                    array[j+1]=array[j];
                    array[j]=temp;
                }
            }
        }
        for (int i = 0; i < array.length; i++) {
            System.out.println(array[i]);
        }
    }

    //选择排序算法
    @Test
    public void sort(){
        int [] array={1,34,4,56,67,7,89};
        for (int i = 0; i < array.length-1; i++) {
            for(int j=i+1;j<array.length;j++){
                if(array[i]<array[j]){
                    int temp=array[i];
                    array[i]=array[j];
                    array[j]=temp;
                }
            }
        }
        for (int i = 0; i < array.length; i++) {
            System.out.println(array[i]);
        }
    }
    ````