排序算法_冒泡排序

 比较一轮后最大的排在最后面，在次重新排序，长度为nums.length-1-j;

public class bubble {//冒泡排序
    public static void main(String[] args) {
        int[] nums = {1,4,2,5,8,3};
        for (int j = 0; j < nums.length-1; j++) {
            for (int i = 0; i < nums.length-1-j; i++) {
                if (nums[i]>nums[i+1]){
                    int temp = nums[i];
                    nums[i] = nums[i+1];
                    nums[i+1] = temp;
                }
            }
        }
    }
}