【冒泡排序】

	/**
	 * 用冒泡排序，按升序给数组排序
	 * @param nums
	 */
	public static void bubble(int nums[]) {
		int temp;
		for (int i = 0; i < nums.length; i++) {
			temp = nums[i];
			for (int j = i + 1; j < nums.length; j++) {
				if(temp > nums[j]) {
					temp = nums[j];
					nums[j] = nums[i];
					nums[i] = temp;
				}
			}
		}
	}

	public static void main(String[] args) {
			System.out.println("冒泡排序法：");
		int arr[] = {9,8,7,6,5,4,3,2,1};
		LCContPolBL.bubble(arr);
		for (int k = 0; k < arr.length; k++) {
			System.out.print(arr[k] + ",");
		}
	}