排序算法－冒泡排序

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int a[] = {2,5,8,12,21,30,44,55,63,63,65};
		int length = a.length;
		int times = 0;
		boolean isChange = false;
		for (int i = length - 1; i > 0; i--) {
			for (int j = 0; j < i; j++) {
				if (a[j] > a[j+1]) {
					int tmp = a[j];
					a[j] = a[j+1];
					a[j+1] = tmp;
					times++;
					isChange = true;
				}
			}
			if(!isChange)
				break;
		}
		System.out.println("times = "+times);
		for (int i = 0; i < length; i++) {
			System.out.print(a[i]+",");
		}
	}