avgtime.cpp

一本全面剖析C++数据结构算法的书籍

// average time for merge sort

#include <iostream.h>
#include <time.h>
#include <stdlib.h>
#include <limits.h>
#include <math.h>
#include "msort.h"

void main(void)
{
   int a[1001], n, i, step = 10;
   long counter;
   float seconds;
   clock_t start, finish;
// comment out for g++
   // randomize();
   for (n = 10; n <= 1000; n += step)
   {// get time for size n
     start = clock( ); counter = 0;
     while (clock( ) - start < 1000000 || counter < 100) {
       counter++;
       for (i = 0; i < n; i++)
          a[i] = rand(); // initialize 
       a[n] = INT_MAX;
       MergeSort(a, n);
     }
     finish = clock( );
     seconds = (finish - start) / CLOCKS_PER_SEC;
     cout << n << ' ' 
          << seconds / counter << endl;
     if (n == 100) step = 100;}
}