排序-冒泡算法

1.冒泡排序

 public static void main(String[] args){
        int[] arr = new int[10];//定义一个需要冒泡排序的数组
        for (int i = 0; i < arr.length; i++){
            Random random = new Random();
            arr[i] = random.nextInt(100);//随机生成需要排序的数组元素
        }
        System.out.println("排序前:" + Arrays.toString(arr));//这一步是把元素封装在数组里面
        System.out.println("冒泡排序开始");
        int temp = 0;
        for (int i1 = 0; i1 < arr.length-1; i1++) {//记住要-1,防止索引越界
            for (int i = 0; i < arr.length - i1 - 1; i++) {
                if (arr[i] > arr[i + 1]) {
                    temp = arr[i];
                    arr[i] = arr[i + 1];
                    arr[i + 1] = temp;
                }
            }
        }
        System.out.println("冒泡排序结束");
        System.out.println("排序后:" + Arrays.toString(arr));
    }

2.arrays.sort()排序

        System.out.println("排序前:" + Arrays.toString(arr)); //排序前:[93, 89, 94, 25, 19, 12, 97, 90, 44, 52]
        Arrays.sort(arr);
        System.out.println("排序后:" + Arrays.toString(arr));//排序后:[12, 19, 25, 44, 52, 89, 90, 93, 94, 97]
        

本文地址：https://blog.csdn.net/weixin_47785112/article/details/109276470