核心原理：比较和交换，是一种直接交换直到数组末尾的算法。
public class BubbleSort {
public static void main(String[] args) {
int[] nums = {123, 4, 32467, 2334, 5634, 8, 6};
for (int i = 0; i<nums.length-1; 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;
}
}
}
System.out.print(“交换结果为：”+ Arrays.toString(nums));
}
}
