冒泡排序

import java.util.Arrays;

public class Demo3 {
public static void main(String[] args) {
int[] nums={8,4,53,23,2,6,3};

for (int i = 0; i < nums.length; i++) {
for (int j = 0; j < nums.length-1-i; j++) {
if(nums[j]>nums[j+1]){

int n = nums[j+1];
nums[j+1]=nums[j];
nums[j]=n;

}
}
}

System.out.println(Arrays.toString(nums));

}
}