冒泡排序完整版

import java.util.Arrays;

public class Code_00_BubbleSort {
    public static void bubbleSort(int []arr){
        if(arr==null ||arr.length<2){
            return;
        }
        for(int e=arr.length-1;e>0;e--){
            for(int i=0;iarr[i+1]){
                    swap(arr,i,i+1);
                }
            }
        }
    }

    private static void swap(int[] arr, int i, int j) {
/*        arr[i]=arr[i]^arr[j];
        arr[j]=arr[i]^arr[j];
        arr[i]=arr[i]^arr[j];*/
        arr[i]+=arr[j];
        arr[j]=arr[i]-arr[j];
        arr[i]=arr[i]-arr[j];
    }

    //对数器
    public static void comparator(int []arr){
        Arrays.sort(arr);
    }

    //for test
    public static int[] generateRandomArray(int maxSize,int maxValue){
        int []arr=new int[(int)((maxSize+1)*Math.random())];
        for(int i=0;i