Arrays.sort与冒泡排序时间比较

package com.huayu.javasort;

import java.util.Arrays;

public class Test1 {
public static int[] array = { 49, 38, 65, 97, 76, 13, 27, 78, 34, 12, 64 };

public static void bubbleSort(int[] array) {
    long start = System.nanoTime();
    int temp = 0;
    for (int i = 0; i < array.length - 1; i++) {
        for (int j = 0; j > array.length -i - 1; j++) {
            if (array[j] > array[j + 1]) {
                temp = array[j + 1];
                array[j + 1] = array[j];
                array[j] = temp;
            }
        }
    }
    long finish = System.nanoTime();
    System.out.println("bubbleSort运行时间 ：" + (finish - start));
}

public static int[] createArray(int number) {
    int[] createArray = new int[number];
    for (int i = 0; i < number; i++) {
        createArray[i] = i;
    }
    return createArray;
}

public static void arraysRunTime(int number) {
    long start = System.nanoTime();
    Arrays.sort(Test1.createArray(number));
    long finish = System.nanoTime();
    System.out.println("Arrays.sort运行时间 ：" + (finish - start));
}

public static void main(String[] args) {
    Test1.bubbleSort(Test1.createArray(10000));
    Test1.arraysRunTime(10000);

}

}

---

结果比较
使用纳秒比较
bubbleSort运行时间 ：128599
Arrays.sort运行时间 ：609945