冒泡排序

import java.util.Arrays;

public class Main {

    public static void main(String[] args) {
        System.out.println("Hello World!");
        int[] array = new int[]{5, 8, 6, 3, 9, 2, 1, 7,4};
        sort(array);
        System.out.println(Arrays.toString(array));

    }

    private static void sort(int array[]) {
        int tmp = 0;
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array.length - i - 1; j++) {
                if (array[j] < array[j + 1]) {
                    tmp = array[j];
                    array[j] = array[j + 1];
                    array[j + 1] = tmp;
                    System.out.println("tmp =" + tmp);
                    System.out.println("array[j] =" + array[j]);
                    System.out.println("array[j + 1] =" + array[j + 1]);
//                    System.out.println("array.length j =" + (array.length - i - 1));
                }
            }
        }
    }


运行结果：
Hello World!
tmp =5
array[j] =8
array[j + 1] =5
tmp =5
array[j] =6
array[j + 1] =5
tmp =3
array[j] =9
array[j + 1] =3
tmp =1
array[j] =7
array[j + 1] =1
tmp =1
array[j] =4
array[j + 1] =1
tmp =5
array[j] =9
array[j + 1] =5
tmp =2
array[j] =7
array[j + 1] =2
tmp =2
array[j] =4
array[j + 1] =2
tmp =6
array[j] =9
array[j + 1] =6
tmp =3
array[j] =7
array[j + 1] =3
tmp =3
array[j] =4
array[j + 1] =3
tmp =8
array[j] =9
array[j + 1] =8
tmp =5
array[j] =7
array[j + 1] =5
tmp =6
array[j] =7
array[j + 1] =6
[9, 8, 7, 6, 5, 4, 3, 2, 1]


注：
list 获取的数据，是有序的
LinkedHashMap 是有序的
HashMap 是无序的，一般满足需求，因为只需要获取到key ，就能获取到值
参考地址：https://www.cnblogs.com/frankdeng/p/9013392.html