#include "header.h"

int main(void){
  double     SmallMat[nSmall][nSmall]; 	//Initialiing a small matrix.
  double 	*RowPointers[nBig];		//Initializing a list for pointers to each row
  double 	*BigVector;				//A pointer for a flat matrix
  int 	 i, j;
  long int   m, n;
  ticks	 in, out;
  
  m = nBig*nBig;
  
  //Seeding the random number generator
  i = (int) time(NULL);
  srand48(i);

  
  // Allocating a big vector
  in = getticks();
  BigVector = (double *) calloc(m, sizeof(double));
  out = getticks();
  printf("%e for calloc!\n", elapsed(out,in));
  
  //Allocating Pointers to rows
  for(i=0; i<nBig; i++){
  	RowPointers[i]=BigVector+nBig*i;
  	}
  
  //forward loops
  in = getticks();
  for(i=0;i<nBig*nBig; i++){
  	BigVector[i] = drand48();
  	}
  out = getticks();
  printf("%e for random number generation and forward linear access and loop!\n", elapsed(out,in));
  
  in = getticks();
  for(i=0;i<nBig*nBig; i++){
  	BigVector[i]; //= drand48();
  	}
  out = getticks();
  printf("%e for forward linear access and loop!\n", elapsed(out,in));
  
  in = getticks();
  for(i=0;i<nBig*nBig; i++){
  	//BigVector[i] = drand48();
  	}
  out = getticks();
  printf("%e for loop!\n", elapsed(out,in));
  
  
  //Backwards loops
  in = getticks();
  for(i=nBig*nBig-1;i>=0; i--){
  	BigVector[i] = drand48();
  	}
  out = getticks();
  printf("%e for random number generation and backward linear access and loop!\n", elapsed(out,in));
  
  in = getticks();
  for(i=nBig*nBig-1;i>=0; i--){
  	BigVector[i]; //= drand48();
  	}
  out = getticks();
  printf("%e for backward linear access and loop!\n", elapsed(out,in));
  
  in = getticks();
  out = getticks();
  printf("%e for just timer!\n", elapsed(out,in));
  
  in = getticks();
  for(i=nBig*nBig-1;i>=0; i--){
  	//BigVector[i] = drand48();
  	}
  out = getticks();
  printf("%e for loop!\n", elapsed(out,in));
  
  
  
  
  //Random Access
  in = getticks();
  for(i=0;i<nBig*nBig; i++){
  	n = lrand48();
  	j = (int)(n%m);
  	BigVector[j]; //Does not do anything may be "optimized away" by the compiler!
  	}
  out = getticks();
  printf("%e for random number generation and random access and loop!\n", elapsed(out,in));
  
  in = getticks();
  for(i=0;i<nBig*nBig; i++){
  	n = lrand48();
  	j = (int)(n%m);
  	}
  out = getticks();
  printf("%e for random number generation and loop!\n", elapsed(out,in));
  
  //Testing the Matrix Thing
  n=lrand48();
  i = (int)(n%nBig);
  n=lrand48();
  j = (int)(n%nBig);
  printf("The (%d,%d)th entry of the matrix (the matrix way) is %e\n", i, j, RowPointers[i][j]);
  printf("the (%d,%d)th entry of the matrix (the vector way) is %e\n", i, j, BigVector[j+i*nBig]);
  
  /* Wait */
  printf("Hit return to continue!\n");
  scanf("%c",&i);
  
  //Clean up the assigned memory
  free(BigVector);
  
  /* Wait */
  printf("Hit return again to continue!\n");
  scanf("%c",&i);
  
  return 0;
  
  //Demo writing to a file!
}