Измерение времени выполнения алгоритма!

#include <iostream.h>
#include<stdlib.h>
#include<stdio.h>
#include<conio.h>
#include<time.h>
clock_t start,finish;

void createCounters(int *, long *, long );
void radixPass(short , long , int *, int *, long *);
void radixSort(int* &, long );
void printMass(int [], int );

main()
{
   int a[5];
   for(int i=0;i<5;i++)
   {
   a=rand()%1000;
   }
  printMass(a, sizeof(a)/sizeof(int));
  radixSort(a, sizeof(a)/sizeof(int));
  printMass(a, sizeof(a)/sizeof(int));
  cin.get();

 return 0;
}

void createCounters(int *data, long *counters, long N)
{
  start=clock();
  memset( counters, 0, 256*sizeof(int)*sizeof(long) );

  char *bp = (char*)data;
  char *dataEnd = (char*)(data + N);
  short i;

    while ( bp != dataEnd )
   {
        for (i=0; i<sizeof(int);i++)
            counters[256*i + *bp++]++;
    }
}

void radixPass (short Offset, long N, int *source, int *dest, long *count)
{
  int *sp;
  long s, c, i, *cp;
  char *bp;

  s = 0;
  cp = count;
  for (i = 256; i > 0; --i, ++cp)
  {
    c = *cp;
    *cp = s;
    s += c;
  }

  bp = (char *)source + Offset;
  sp = source;
  for (i = N; i > 0; --i, bp += sizeof(int) , ++sp)
  {
    cp = count + *bp;
    dest[*cp] = *sp;
    ++(*cp);
  }
}

void radixSort (int* &in, long N)
{
  int *out = new int[N];
  int *temp = new int[N];
  long *counters = new long[sizeof(int)*256], *count;
  createCounters(in, counters, N);

  for (short i=0; i<sizeof(int); i++)
  {
    count = counters + 256*i;

    if ( count[0] == N ) continue;

    radixPass (i, N, in, out, count);
    for(int i = 0;i < N; ++i)
    {
     temp=in;
     in=out;
     out=temp;
    }
  }

  delete out;
  delete counters;
  delete temp;
}

void printMass(int A[], int f)
{
  cout << "\nMass:";
  for(int i = 0; i < f; i++)
  cout << ' ' << A;
  cout << '\n';


  }

#include<time.h>
clock_t start,finish;
start-clock();
................
finish=clock();
float time=(finish-start)/CLK_TCK