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-1
for (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));
}
}
冒泡排序
最新推荐文章于 2023-06-06 09:14:05 发布