Exemplo n.º 1
0
// sorted vector benchmark with integer values
void SortedVecBench(const int& n) {
  TIntV Vec;
  float ft0, ft1;
  int x;
  int i;
  int Found;
  int NotFound;
  int Id;

  // build the vector
  ft0 = GetCPUTime();
  for (i = 0; i < n; i++) {
    x = (int) (drand48() * 100000000);
    //Vec.AddSorted(x);
    Vec.AddMerged(x);
  }
  printf("svec:          size %d\n", Vec.Len());

  ft1 = GetCPUTime();
  printf("svec: %7.3fs inserting  %d numbers\n",ft1-ft0,i);

  // search the vector
  ft0 = GetCPUTime();
  Found = 0;
  NotFound = 0;
  for (i = 0; i < n; i++) {
    x = (int) (drand48() * 100000000);
    Id = Vec.IsInBin(x);
    if (Id == 0) {
      NotFound++;
    } else {
      Found++;
    }
  }
  printf("svec:          found %d, notfound %d\n", Found, NotFound);

  ft1 = GetCPUTime();
  printf("svec: %7.3fs searching %d numbers\n",ft1-ft0,i);
}