冒泡排序（java版）

package order;

import java.util.Arrays;

public class Maopao {

    public static void sort1(int [] array){
        for(int i=0;i<array.length-1;i++){
            for(int j=0;j<array.length-1-i;j++){
                int temp;
                if (array[j]>array[j+1]){
                    temp=array[j];
                    array[j]=array[j+1];
                    array[j+1]=temp;
                }

            }System.out.println(Arrays.toString(array)+"    "+(i+1));
        }
    }


   public static void sort2(int [] array){
        for(int i=0;i<array.length-1;i++){
            boolean isSorted=true;
            for(int j=0;j<array.length-1-i;j++){
                int temp;

                if (array[j]>array[j+1]){
                    temp=array[j];
                    array[j]=array[j+1];
                    array[j+1]=temp;
                    isSorted=false;
                }

            }
            if (isSorted){
                break;
            }
            System.out.println(Arrays.toString(array)+"    "+(i+1));
        }
    }

    public static void sort3(int [] array){
        int lastChangeIndex=0;
        int sortBorder=array.length-1;
        for (int i=0;i< array.length-1;i++){
            int temp;
            boolean isSort=true;
            for (int j=0;j< sortBorder;j++){
                if (array[j]>array[j+1]){
                    temp=array[j];
                    array[j]=array[j+1];
                    array[j+1]=temp;
                    isSort=false;
                    lastChangeIndex=j;
                }
            }
            sortBorder=lastChangeIndex;
            if (isSort){
                break;
            }
            System.out.println(Arrays.toString(array)+"    "+(i+1));
        }
    }
    //鸡尾酒
    public static void sort4(int [] array){
        int temp=0;
        for (int i=0;i< array.length/2;i++){
            boolean isSort=true;
            //奇数轮
            for (int j=0;j< array.length-1-i;j++){
                if (array[j]>array[j+1]){
                    temp=array[j];
                    array[j]=array[j+1];
                    array[j+1]=temp;
                    isSort=false;
                }
            }
            if (isSort){
                break;
            }
            isSort=true;
            for (int j=array.length-1-i;j>i ;j--){
                if (array[j]<array[j+1]){
                    temp=array[j];
                    array[j]=array[j+1];
                    array[j+1]=temp;
                    isSort=false;
                }
            }
            if (isSort){
                break;
            }
            System.out.println(Arrays.toString(array)+"    "+(i+1));
        }
    }


    public static void main(String[] args) {
        int [] array1 = new int[]{8,6,10,3,1,5,4,0,7};
        int [] array2 = new int[]{8,6,10,3,1,5,4,0,7};
        int [] array3 = new int[]{8,6,10,3,1,21,22,23,24};
        int [] array4 = new int[]{2,3,4,12,6,7,1,8};

        sort1(array1);
        System.out.println(Arrays.toString(array1));
        System.out.println("---------------------------");
        sort2(array2);
       System.out.println(Arrays.toString(array2));
        System.out.println("---------------------------");
        sort3(array3);
        System.out.println(Arrays.toString(array3));
        System.out.println("---------------------------");
        sort1(array4);
        System.out.println(Arrays.toString(array4));
        System.out.println("---------------------------");
        sort4(array4);
        System.out.println(Arrays.toString(array4));
    }
}