冒泡排序

冒泡排序
		boolean swapped = true; 	//	有没有发生过交换
		for (int i = 1; swapped && i < math.length - 1; i++) {
			swapped = false; //没有发生过交换
			for (int j = 0; j < math.length - i; j++) {
				if(math[j] > math[j + 1]){
					 temp1 = math[j];
					 math[j] = math[j + 1];
					 math[j + 1] = temp1;
					 swapped = true;
				}
			}
			
		}
		System.out.print("\n冒泡排序后：");
		for(int x : math){
			System.out.print(x + " ");
		}