java数组排序、冒泡排序算法

数组排序

1、整形数组

		Random rand = new Random();
        Integer[] n = new Integer[6];
        for (int j = 0; j < n.length; j++) {
            n[j] = rand.nextInt(1, 11);
        }
        System.out.println(Arrays.toString(n));

        //升序
        //Arrays.sort(n, Comparator.comparingInt(a -> a));
        Arrays.sort(n, (a, b) -> a - b);
        System.out.println(Arrays.toString(n));

        //降序
        Arrays.sort(n, (a, b) -> b - a);
        System.out.println(Arrays.toString(n));

        //乱序
        Arrays.sort(n, (a, b) -> Math.random() > .5 ? 1 : -1);
        System.out.println(Arrays.toString(n));

2、冒泡排序算法

	Random rand = new Random();
        int[] nums = new int[10];
        for (int j = 0; j < nums.length; j++) {
            nums[j] = rand.nextInt(1, 101);
        }
        System.out.println(Arrays.toString(nums));

        for (int i = 0; i < nums.length; i++) {
            // < 是升序    > 是降序
            for (int j = 0; j < nums.length-1; j++) {
                if (nums[j]>nums[j+1]){
                    int t =nums[j+1];
                    nums[j+1]=nums[j];
                    nums[j]=t;
                }else{
                    continue;
                }
            }
        }
        System.out.println(Arrays.toString(nums));

3、字符串数组

		String[] ss = new String[]{"a", "java", "c", "c++", "php", "b", "x", "y", "javascript"};
        for (String s : ss) {
            System.out.printf("%s ", s);
        }
        System.out.println();
        //按照英文字母顺序排列
        Arrays.sort(ss);
        System.out.println(Arrays.toString(ss));
        //按照元素长度，升序
        Arrays.sort(ss, (a, b) -> a.length() - b.length());
        System.out.println(Arrays.toString(ss));
        //按照元素长度，降序
        Arrays.sort(ss, (a, b) -> b.length() - a.length());
        System.out.println(Arrays.toString(ss));
        //乱序
        Arrays.sort(ss, (a, b) -> Math.random() > .5 ? 1 : -1);
        System.out.println(Arrays.toString(ss));