冒泡排序之优化算法

package com.arrays;

import java.util.Arrays;

public class Bubbling {

public static void main(String[] args) {
	// TODO Auto-generated method stub
	int[] arrs = new int[100];
	for (int i = 0; i < 100; i++) {
		int a = (int) (Math.random() * 100);
		arrs[i] = a;
	}
	for (int i = 0; i <= arrs.length - 1; i++) {
		boolean flag = true;// true为有序false为无序
		for (int j = 0; j < arrs.length - 1 - i; j++) {
			if (arrs[j] > arrs[j + 1]) {
				int temp = 0;
				temp = arrs[j];
				arrs[j] = arrs[j + 1];
				arrs[j + 1] = temp;
				flag = false;
			}

		}
		if (flag == true) {

			break;
		}

	}
	System.out.println(Arrays.toString(arrs));

}

}