import java.util.concurrent.*;
import java.util.*;
import easyIO.*;
// enklest mulig modell-kode for parallellitet,
// se Model2.java for tidtaking mm
class Tider2017 {
	Out ut;
	int n;

	void println(String s){
		System.out.println(s);
		ut.outln(s);
	}

     //  felles data og metoder A
      public static void main(String [] args) {
		  if ( args.length != 3)	{
		  			System.out.println("use: >java Tider2017  <n> <arrayLen> <fil>");
	      } else {
            Tider2017 p = new Tider2017();
            p.utfoer(args);
		}
      }

      int neste(int i){
		  return i+1;
	  }

      void utfoer (String [] args) {
		  n = Integer.parseInt(args[0]);
		  int aLen = Integer.parseInt(args[1]);
		  ut = new Out(args[2],true);  // Open with append
          int k=0;
		  long t;
		  double d,f1,f2;
		  String s;
		  int [] ia,ib;
		  Thread t1;
		   double [] db, db2;
		  Random r;

		  class C { int i;C(int i){ this.i =i;} int les () { return i+10;} } // end C
          class D { int i;D(int i){ this.i =i;} int les () { return i+11;} } // end D

          println("\nFra tidene for mange ganger eksekvering trekkes tiden\nfor like mange ganger for-loop\n");

		  //for-loop
		  s ="for-loop";
		  k =1;
		  t = System.nanoTime();
		    for (int i = 0; i<1; i++) {
				//k=0;
			}
		  f1= d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,12,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
			 // k = 33 ;
		  }
		  f2=  d = (double) ((System.nanoTime() -t)/(n*1000.0));
		  println(s+Format.align(d,12,4)+"us.snitt " + n+" ganger");

	     //Metodekall
		  s ="Metodekall";
		  t = System.nanoTime();
		  k=neste(k);
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,12,5)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
			  k+=neste(k);
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0)) ;
		  println(s+Format.align(d,12,5)+"us.snitt " + n+" ganger");


		  s ="Array new len ="+aLen;
		  t = System.nanoTime();
		  ia = new int[aLen];
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,12,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
		     ia = new int[aLen];
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0)) ;
		  println(s+Format.align(d,12,4)+"us.snitt " + n+" ganger");


		  s ="Array copy for-loop len  ="+aLen;
		  ia = new int[aLen];
		  for (int i=0;i<aLen;i++) ia[i] = i+5;
		  ib = new int[aLen];
		  t = System.nanoTime();
 		   for (int j = 0;j<aLen;j++)
			     ib[j] = ia[j] ;
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,12,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
			  for (int j = 0;j<aLen;j++)
			     ib[j] = ia[j] ;
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
		  println(s+Format.align(d,12,4)+"us.snitt " + n+" ganger");


		  // System.arraycopy
		  s ="Array copy arraycopy len ="+aLen;
		  ia = new int[aLen];
		  for (int i=0;i<aLen;i++) ia[i] = i+5;
		  ib = new int[aLen];
		  t = System.nanoTime();
		     System.arraycopy(ia,0,ib,0,aLen);
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,12,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
              System.arraycopy(ia,0,ib,0,aLen);
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
		  println(s+Format.align(d,12,4)+"us.snitt " + n+" ganger");

		  s ="new Thread() start & join ";
		  t = System.nanoTime();
		   (t1 = new Thread(new Arbeider(3))).start();
		  try{t1.join();}catch (Exception e){}
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,12,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
			  (t1 = new Thread(new Arbeider(3))).start();
			  try{t1.join();}catch (Exception e){}
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
		  println(s+Format.align(d,12,4)+"us.snitt " + n+" ganger");
          System.gc();

		  s ="new Class C+ metodekall ";
		  t = System.nanoTime();
		  k= new C(k).les();
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,12,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
			    k= new C(k).les();
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
		  println(s+Format.align(d,12,4)+"us.snitt " + n+" ganger");

		  s ="new Class D+ metodekall ";
		  t = System.nanoTime();
		  k= new D(k).les();
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,12,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
				k= new D(k).les();
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
		  println(s+Format.align(d,12,4)+"us.snitt " + n+" ganger");

		  s ="Array write";
		  t = System.nanoTime();
		  ia[55%aLen] =669;
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,12,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i< n; i++) {
			  ia[i%aLen] =i;
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
		  println(s+Format.align(d,12,4)+"us.snitt " + n+" ganger");



		  //Array les
		  s ="Array les ";
		  t = System.nanoTime();
		  k = ia[55%aLen];
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,12,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
				k = ia[i%aLen];
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
		  println(s+Format.align(d,12,4)+"us.snitt " + n+" ganger");


 	     //Convert double to long
 		  s ="Double to long ";
 		   db = new double[n];
 		    r = new Random(123);
 		   for (int i = 0; i<n; i++) {
 			   db [i]= r.nextDouble();
 		   }
 		  t = System.nanoTime();
 		  long ll=Double.doubleToLongBits(db[1]);
 		  d = (double) ((System.nanoTime() -t)/1000.0);
 		  println(s+Format.align(d,10,4)+"us. forste gang");
 		   t = System.nanoTime();
 		  for (int i = 0; i<n; i++) {
 				ll = Double.doubleToLongBits(db[i]);
 		  }
 		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
 		  println(s+Format.align(d,10,4)+"us.snitt " + n+" ganger");


 	     //Test simple insertsort
 		  s ="simple insertsort1 ";
 		  int len = Math.min(aLen,2000);
 		  db = new double[len];
 		  db2 = new double[len];
 		  r = new Random(123);
 		   for (int i = 0; i<len; i++) {
 			   db [i]= r.nextDouble();
 			   db2[i] = db[i];
 		   }
 		  t = System.nanoTime();
 		  insertSort1(db,0,len-1);
 		  d = (double) ((System.nanoTime() -t)/1000.0);
 		  println(s+Format.align(d,14,4)+"us. forste gang, len:"+len);

 		   t = System.nanoTime();
 		  for (int i = 0; i<n; i++) {
			     System.arraycopy(db2,0,db,0,len);
 				 insertSort1(db,0,len-1);
 		  }
 		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
 		  println(s+Format.align(d,14,4)+"us.snitt " + n+" ganger, len:"+len);

        ut.close();

      }

       class Arbeider implements Runnable {
	       int ind;
	       // lokale data og metoder B til hver traad
	              Arbeider (int in) {ind = in;}
	               public void run( ) {
	                   ind++;
	               } // end run
      } // end indre klasse Arbeider

      public static void insertSort1(double a[],int left, int right) {
           int i,k;
           double t;

           for (k = left ; k < right; k++) {
               t = a[k+1];
               i = k;

               while (i >= left && a[i] > t) {
                    a[i+1] = a[i];
                    i--;
               }
               a[i+1] = t;
         }
    } // end insertSort1


} // end class Tider2017