[算法] - 冒泡排序

public class MaoPaoDemo {

    public static void maoPao(int[] arr, int l, int r){
        for (int i = 0; i < arr.length; i++) {
            for(int j = 0;j< (arr.length - i -1);j++){
                if(arr[j] > arr[j+1]){
                    swap(arr, j ,j+1);
                }
            }
        }
    }

    public static void swap(int[] arr, int s, int d){
        int tmp = arr[s];
        arr[s] = arr[d];
        arr[d] = tmp;
    }

    public static void main(String[] args) {
        int[] arr = {2,4,5,3,1,8,1,4,3};
        maoPao(arr, 0, arr.length-1);
        System.out.println(Arrays.toString(arr));
    }
}