冒泡排序算法

	public static void main(String[] args) {
		int[] nums = {5,1,7,9,4,8,2,6,3};
		for(int i =0;i<nums.length;i++){
			for(int j=0;j<nums.length - i - 1;j++){
				if(nums[j]>nums[j+1]){
					int temp = nums[j];
					nums[j] = nums[j+1];
					nums[j+1] = temp;
				}
			}
		}
		for(int i=0;i<nums.length;i++){
			System.out.println(nums[i]);
		}
	}