冒泡排序

public void swap(int[] data, int i,int j){
    if(i == j){
        return;
    }
    data[i] = data[i] + data[j];
    data[j] = data[i] - data[j];
    data[i] = data[i] - data[j];
}

public void bubbleSort(int[] data){
    for(int i = 0;i<data.length;i++){
        boolean isSorted = false;
        for(int j = 0;j< data.length - i -1;j++){
            if(data[j] > data[j+1]){
                swap(data,j,j+1);
                isSorted = true;
            }
        }
        if(!isSorted){
            break;
        }
    }
}