<span style="white-space:pre"> </span>int[] nums = {1,2,8,9,0,6,7,5,4,8,6,4,3};
for (int i = 0; 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;
}
}
System.out.println(nums[i]);
}
冒泡排序速记口诀:
N个数字来排队,
两两相比小靠前
外层循环N-1
内层循环N-1-i