归并排序的改进算法（使用静态链表）的时间复杂度分析

import java.util.Random;public class MergeSortL {static int insert(int[] a, int[] link, int start, int end) {// 静态链表插入排序int liststart = start;for (int i = start + 1; i <= end; i++) {if (a[i] <= a[liststart]) {// 比链表中第一个元素要小link[i] = liststart;liststart = i;} else {int j = liststart;while ((link[j] != -1) && (a[link[j]] <= a[i]))// 在链表中查找该插入的位置j = link[j];if (link[j] == -1)// 所有元素都要大link[j] = i;else {// 在链表中间位置插入link[i] = link[j];link[j] = i;}}}return liststart;}static int merge(int[] a, int[] link, int p, int q) {int liststart;// 判断链表头结点if (a[p] > a[q]) {liststart = q;q = link[q];} else {liststart = p;p = link[p];}int current = liststart;while ((p != -1) && (q != -1)) {// 合并链表if (a[p] <= a[q]) {link[current] = p;current = p;p = link[p];} else {link[current] = q;current = q;q = link[q];}}// 把剩下的放入大链表中if (p == -1)link[current] = q;elselink[current] = p;return liststart;}static int Sort(int[] a, int[] link, int low, int high) {if (high - low + 1 < 16)return insert(a, link, low, high);else {int p = Sort(a, link, low, (low + high) / 2);int q = Sort(a, link, (low + high) / 2 + 1, high);return merge(a, link, p, q);}}public static void main(String[] args) {long mid = 0L;int all = 10000;// 为了得到更准确的结果，应该把all次运算的平均值作为结果for (int n = 1; n <= 10; n++) {int[] test = new int[n * 100];int[] link = new int[n * 100];Random rand = new Random(47);for (int j = 0; j < all; j++) {for (int i = 0; i < n * 100; i++) {test[i] = rand.nextInt(10000);link[i] = -1;}long startTime = System.nanoTime();Sort(test, link, 0, n * 100 - 1);long endTime = System.nanoTime();mid += endTime - startTime;}mid /= all;System.out.println("" + n * 100 + ":" + mid);}}}

结果（纳秒）：

100:6758
200:13451
300:21494
400:28797
500:38295
600:46891
700:54955
800:63461
900:72678
1000:83642

注:不同机器以及同一机器在不同时刻得到时间都是有差别的