benchmark mergesort on sorted arrays

diff --git a/ksort_test.c b/ksort_test.c
index 4a4e9d0d2f7faf6f5a413d9b2dff7be2326df0c9..f34f63a1e995dacf3303514e994e1d1a34442c6e 100644 (file)
--- a/ksort_test.c
+++ b/ksort_test.c
@@ -65,6 +65,11 @@ int main(int argc, char *argv[])
                }
        }
 
+       t1 = clock();
+       ks_mergesort(int, N, array, 0);
+       t2 = clock();
+       fprintf(stderr, "mergesort (sorted): %.3lf\n", (double)(t2-t1)/CLOCKS_PER_SEC);
+
        srand48(11);
        for (i = 0; i < N; ++i) array[i] = (int)lrand48();
        t1 = clock();