冒泡排序

public static void bubbleSort(double[] A){
    int N = A.length;
    for(int i = 0; i < N -1 ; ++i){
        boolean flag = true;
        for(int j = 0; j < N-1-i; ++j){
             if(compareTo(A[j], A[j+1]) == 1){
                 exchange(A, j, j+1);
                 flag = false;
             }
        }
        if(flag == true){
            break;
        }
    }
}