java冒泡排序和递归排序

冒泡排序

 static int[] array = new int[]{
      1,3,26,19,2,3,64,5,6,97,8,9
    };

    /**
     * 冒泡排序
     * @param array 数组
     * @return
     */
    private static int[] bubbleSort(int[] array){

        for(int i=0; i<array.length-1;i++){
            for(int j = i+1; j<array.length;j++){
                if(array[i]>array[j]){
                    int p = array[i];
                    array[i] = array[j];
                    array[j] = p;
                }
            }
        }
        return array;
    }

用递归的方式排序

  /**
     * 递归排序
     * @param array
     */
    private static void recursiionSort(int[] array, int j){

        //一般递归排序
       /* if(j >= array.length){
            return;
        }

        for(int i = j+1; i<array.length;i++){
            if(array[j]>array[i]){
                int p = array[i];
                array[i] = array[j];
                array[j] = p;
            }
        }

        recursiionSort(array, ++j);*/

        //优化递归排序
        if(j == 0){
            return;
        }

        int x = 0;
        for(int i = 0; i < j; i++){
            if(array[i]>array[i+1]){
                int p = array[i];
                array[i] = array[i+1];
                array[i+1] = p;
                x = i;
            }
        }

        recursiionSort(array, x);

    }

全部代码

public class Sort {

    static int[] array = new int[]{
      1,3,26,19,2,3,64,5,6,97,8,9
    };

    /**
     * 冒泡排序
     * @param array 数组
     * @return
     */
    private static int[] bubbleSort(int[] array){

        for(int i=0; i<array.length-1;i++){
            for(int j = i+1; j<array.length;j++){
                if(array[i]>array[j]){
                    int p = array[i];
                    array[i] = array[j];
                    array[j] = p;
                }
            }
        }
        return array;
    }


    /**
     * 递归排序
     * @param array
     */
    private static void recursiionSort(int[] array, int j){

        //一般递归排序
       /* if(j >= array.length){
            return;
        }

        for(int i = j+1; i<array.length;i++){
            if(array[j]>array[i]){
                int p = array[i];
                array[i] = array[j];
                array[j] = p;
            }
        }

        recursiionSort(array, ++j);*/

        //优化递归排序
        if(j == 0){
            return;
        }

        int x = 0;
        for(int i = 0; i < j; i++){
            if(array[i]>array[i+1]){
                int p = array[i];
                array[i] = array[i+1];
                array[i+1] = p;
                x = i;
            }
        }

        recursiionSort(array, x);

    }


    public static void main(String[] args) {

        for(int i=0; i< array.length;i++){
            System.out.print(array[i]+" ");
        }
        System.out.println("");

        // sort.bubbleSort(sort.array);

       // sort.recursiionSort(sort.array,0);  //一般递归排序
        recursiionSort(array,array.length-1);

        for(int i=0; i< array.length;i++){
            System.out.print(array[i]+" ");
        }
    }

}