import java.util.Arrays;

public class Main {
    public static void main(String[] args) {
        while (true) {
            int[] ns1 = gennerateArray(20000, 100000);
            int[] ns2 = new int[ns1.length];
            // 拷贝数组
            for (int i = 0; i < ns1.length; i++) {
                ns2[i] = ns1[i];
            }


            // 方法一  示例
            System.out.println("排序前 ns1:" + Arrays.toString(ns1));
            long t1 = System.currentTimeMillis();

            for (int i = 0; i < ns1.length - 1; i++) {
                for (int j = 0; j < ns1.length - i - 1; j++) {
                    if (ns1[j] > ns1[j + 1]) {
                        // 交换ns[j]和ns[j+1]:
                        int tmp = ns1[j];
                        ns1[j] = ns1[j + 1];
                        ns1[j + 1] = tmp;
                    }
                }
            }

            long t2 = System.currentTimeMillis();
            long spend1 = (t2 - t1) * 1000; //毫秒
            System.out.println("排序后 ns1:" + Arrays.toString(ns1));


            //方法二  改进
            System.out.println("排序前 ns2:" + Arrays.toString(ns2));
            long t3 = System.currentTimeMillis();

            int num = 1;
            while (true) {
                int flag = 0;
                for (int i = 0; i < ns2.length - num; i++) {
                    if (ns2[i] > ns2[i + 1]) {
                        int tmp = ns2[i];
                        ns2[i] = ns2[i + 1];
                        ns2[i + 1] = tmp;
                        flag = 1;
                    }
                }
                num += 1;
                if (flag == 0) break;
            }

            long t4 = System.currentTimeMillis();
            long spend2 = (t4 - t3) * 1000; //毫秒

            System.out.println("排序后 ns2:" + Arrays.toString(ns2));

            System.out.println("排序后 ns1 用时(毫秒):" + spend1);
            System.out.println("排序后 ns2 用时(毫秒):" + spend2);

            if (Arrays.toString(ns1).equals(Arrays.toString(ns2))) {
                System.out.println("两种方法结果相等");
            } else {
                System.out.println("两种方法结果不想等");
            }
        }
    }


    public static int[] gennerateArray(int len, int max) {
        int[] arr = new int[len];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = (int) (Math.random() * max);
        }
        return arr;
    }

}