java实现冒泡算法的几种方式

int[] arr = {10, 2, 43, 12, 26};
        int temp = 0;

        for(int i=0; i < arr.length; i++){
            for(int j=1; j < (arr.length-i); j++){
                if(arr[j-1] > arr[j]){
                    temp = arr[j-1];
                    arr[j-1] = arr[j];
                    arr[j] = temp;
                }
            }
        }

int[] arr = {10, 2, 43, 12, 26};
int temp = 0;
boolean swapped = true;

while(swapped){
    swapped = false;
    for(int i=0; i < arr.length-1; i++){
        if(arr[i] > arr[i+1]){
            temp = arr[i];
            arr[i] = arr[i+1];
            arr[i+1] = temp;
            swapped = true;
        }
    }
}

int[] arr = {10, 2, 43, 12, 26};
int temp = 0;
boolean swapped = true;

do{
    swapped = false;
    for(int i=0; i < arr.length-1; i++){
        if(arr[i] > arr[i+1]){
            temp = arr[i];
            arr[i] = arr[i+1];
            arr[i+1] = temp;
            swapped = true;
        }
    }
} while(swapped);