冒泡排序

public class MaoPao {public static void main(String[] args) {int[] nums = { 3, 7, 9, 6, 5 };System.out.println(Arrays.toString(nums));//外层循环比较4次4是length-1for (int i = 0; i < nums.length - 1; i++) {//内层循环逐个比较，外层循环次数越多，内层循环次数越少for (int j = 0; j < nums.length - i - 1; j++) {//比较nums[j]和nums[j+1]，如果nums[j]大，则交换if (nums[j] > nums[j + 1]) {int temp = nums[j];nums[j] = nums[j + 1];nums[j + 1] = temp;}}}System.out.println(Arrays.toString(nums));}}