冒泡排序的递归写法

只用一个循环，剩下的交给递归

package sort;


public class BubbleSort {
    public static void sort(int[] arr, int endIndex){
        if (endIndex==0){
            return ;
        }
        for (int i=0;iarr[i+1]){
                Swap.swap(arr,i,i+1);
            }
        }
        sort(arr,endIndex-1);
    }

    public static void main(String[] args) {
        int[] array = {9,4,28,7,0,78,3,2};
        BubbleSort.sort(array, array.length - 1);
        for (int x :array) {
            System.out.println(x);
        }
    }
}

package sort;

public class Swap {
    public static void swap(int[] array, int x, int y){
        int tmp = array[x];
        array[x] = array[y];
        array[y] = tmp;
    }
}