冒泡排序

package lbs;
import java.util.Arrays;

//冒泡排序
public class Num4 {
    public static void main(String[] args) {
        System.out.println("冒泡排序:");
        int arr[] = {2,4,1,3,5,7,9,8,6};
        System.out.println(Arrays.toString(arr));
        
        for (int i=0;i<arr.length-1;i++){
            boolean flag = false;    //若本趟未发生交换，说明已经有序了，可以提前结束循环
            for (int j=0;j<arr.length-1-i;j++){
                if (arr[j]>arr[j+1]) {
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                    flag = true; 
                }
            }
            if (flag == false) {
                break;
            }
        }
        
        System.out.println(Arrays.toString(arr));
    }    
}