冒泡排序测试

冒泡排序算法小结

public static void main(String[] args) {
		int[] nums = { 1, 3, 5, 6, 8, 15, 4, 22 };
		// 外层循环的轮数
		for (int i = 0; i < nums.length - 1; i++) {
		//nums.length - 1 - i内层的循环次数，比较一次就少一次
			for (int j = 0; j < nums.length - 1 - i; j++) {
				if (nums[j] < nums[j + 1]) {
				//定义一个临时变量来交换值
					int temp = nums[j];
					nums[j] = nums[j + 1];
					nums[j + 1] = temp;
				}
			}
		}
		//[22, 15, 8, 6, 5, 4, 3, 1]
		System.out.println(Arrays.toString(nums));
	}