冒泡排序
public static void main(String[] args) {
/**
* 冒泡排序
* N个数字来排队
* 两两相比小靠前
* 外层循环N-1
* 内层循环N-1-i
*/
int[] nums={3,1,-2,9,6,55,7};
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 num = nums[j];
nums[j]=nums[j+1];
nums[j+1]=num;
}
}
}
System.out.println(Arrays.toString(nums));
}