冒泡排序 快速排序

@Test
    public void sort(){
        int[] array = {4,7,1,2,5,8,6,3};
        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] = array[j+1];
                    array[j+1] = temp;
                }
            }
        }
        
        for(int i=0;i<array.length;i++){
            System.out.println(array[i]);
        }
    }