import java.util.concurrent.*;
import java.util.*;
import easyIO.*;
// enklest mulig modell-kode for parallellitet,
// se Model2.java for tidtaking mm
class Tider2018_komp {
	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 != 2)	{
		  			System.out.println("use: >java Tider2018_komp  <n>  <fil>");
	      } else {
            Tider2018_komp p = new Tider2018_komp();
            p.utfoer(args);
		}
      }

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

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



		  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("\nGjennomsnittstider per gang.\n");
          s ="for-loop"+Format.align(n,7)+"x             ";
		  k =0;


	    t = System.nanoTime();
		  for (int j = 0 ; j <= n; j++ ) {

		    for (int i = 0; i<= 1000; i++) {
			 k+= i;
		    }
		  }
		  m = (System.nanoTime() -t);
		  if (m == 0) println("ERR m 0");
		  d = (double) (m/(n*1000.0));
		  println(s+Format.align(d,10,4)+"us.midlere verdi  " + n+" ganger"+k);

	     //Metodekall ---------
		  s ="Metodekall                  ";
		  t = System.nanoTime();

		  for (int i = 0; i<=n; i++) {

			  k+=neste(k);
		  }
		  m = (System.nanoTime() -t);
		  if (m == 0) println("ERR m 0");
		  d = (double) (m/(n*1000.0));
		  println(s+Format.align(d,11,4)+"us.midlere verdi  " + n+" ganger");

          // Array -------------
		  s ="Array new len           ="+aLen+"" ;
		 t = System.nanoTime();
		  for (int i = 0; i<=n; i++) {

		     ia = new int[aLen];
		  }
		  m = (System.nanoTime() -t);
		  if (m == 0) println("ERR m 0");
		  d = (double) (m/(n*1000.0));
		  println(s+Format.align(d,10,3)+"us.midlere verdi  " + n+" ganger");


          // Array-copy ----------------------
		  s ="Array copy for-loop l=100   ";
		  ia = new int[aLen];
		  for (int i=0;i<aLen;i++) ia[i] = i+5;
		  ib = new int[aLen];
		   t = System.nanoTime();
		  for (int i = 0; i<=n; i++) {

			  for (int j = 0;j<aLen;j++)
			     ib[j] = ia[j] ;
		  }
		  m = (System.nanoTime() -t);
		  if (m == 0) println("ERR m 0");
		  d = (double) (m/(n*1000.0));
		  println(s+Format.align(d,10,3)+"us.midlere verdi  " + n+" ganger");


		  // System.arraycopy -----------------------
		  s ="Array copy arraycopy l=100, ";
		  ia = new int[aLen];
		  for (int i=0;i<aLen;i++) ia[i] = i+5;
		  ib = new int[aLen];
    	  t = System.nanoTime();
		  for (int i = 0; i<=n; i++) {
              System.arraycopy(ia,0,ib,0,aLen);
		  }
		  m = (System.nanoTime() -t);
		  if (m == 0) println("ERR m 0");
		  d = (double) (m/(n*1000.0));
		  println(s+Format.align(d,10,3)+"us.midlere verdi  " + n+" ganger");

/*        // ------------ new thread ---------------
		  s ="new Thread() start & join   ";
          t = System.nanoTime();
		  for (int i = 0; i<=n; i++) {

			  (t1 = new Thread(new Arbeider(3))).start();
			  try{t1.join();}catch (Exception e){}
		  }
		  m = (System.nanoTime() -t);
		  if (m == 0) println("ERR m 0");
		  d = (double) (m/(n*1000.0));
		  println(s+Format.align(d,10,3)+"us.midlere verdi  " + n+" ganger");
          System.gc();

*/


     // ------------ Two  new threadc  individually ---------------
		  s ="2sep new Thread() start & join ";
          t = System.nanoTime();
		  for (int i = 0; i<=n; i++) {

			   (t1 = new Thread(new Arbeider(3))).start();
			   (t2 = new Thread(new Arbeider(i))).start();

			    try{t1.join();t2.join();}catch (Exception e){}
		  }
		  m = (System.nanoTime() -t);
		  if (m == 0) println("ERR m 0");
		  d = (double) (m/(n*1000.0));
		  println(s+Format.align(d,10,3)+"us.midlere verdi  " + n+" ganger");
          System.gc();

        // ------------ Two new new threads in array ---------------
		  s ="2 arr new Thread() start & join";
          t = System.nanoTime();
		  for (int i = 0; i<=n; i++) {

			  for (int j=0;j<2; j++) {
				  (tt[j] = new Thread(new Arbeider(3))).start();
			  }
              try{  for (int j=0;i<2; j++){ tt[j].join(); }}
              catch (Exception e){};

		  }
		  m = (System.nanoTime() -t);
		  if (m == 0) println("ERR m 0");
		  d = (double) (m/(n*1000.0));
		  println(s+Format.align(d,10,3)+"us.midlere verdi  " + n+" ganger");
          System.gc();




		  //---------------- new class-------------------
		  s ="new Class C+ metodekall     ";
		  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,10,3)+"us.midlere verdi  " + n+" ganger");
          m=0;
		  s ="new Class D+ metodekall   ";
		  for (int i = 0; i<=n; i++) {
			   t = System.nanoTime();
				k= new D(k).les();
				 m += (System.nanoTime() -t);
		  }

		  if (m == 0) println("ERR m 0");
		  d = (double) (m/(n*1000.0));
		  println(s+Format.align(d,12,3)+"us.midlere verdi  " + n+" ganger");

		  s ="Array write                   ";

		  t = System.nanoTime();
		  for (int i = 0; i< n; i++) {

			  ia[i%aLen] =i;
		  }
		  m = (System.nanoTime() -t);
		  if (m == 0) println("ERR m 0");
		  d = (double) (m/(n*1000.0));
		  println(s+Format.align(d,10,5)+"us.midlere verdi  " + n+" ganger");


		  //Array les
		  s ="Array les                   ";
    	   t = System.nanoTime();

		  for (int i = 0; i<=n; i++) {
             // t = System.nanoTime();
				k = ia[i%aLen];
			 //  m += (System.nanoTime() -t);

		  }
		  m = (System.nanoTime() -t);
		  if (m == 0) println("ERR m 0");
		  d = (double) (m/(n*1000.0));
		  println(s+Format.align(d,12,5)+"us.midlere verdi  " + n+" ganger, k:"+k);


 	     //Convert double to long
	    		  s ="Double to long            ";
	    		   db = new double[n];
	    		    r = new Random(123);
	    		    m=0;

	    		   for (int i = 0; i<n; i++) {
	    			   db [i]= r.nextDouble();
	    		   }
	    		  long ll=0;

	             t = System.nanoTime();
	    		  for (int i = 0; i<n; i++) {
	   			   //t = System.nanoTime();
	    				ll = Double.doubleToLongBits(db[i]);

	    		  }
	   		  m = (System.nanoTime() -t);
	   		  if (m == 0) println("ERR m 0");
	   		  d = (double) (m/(n*1000.0));
 		  println(s+Format.align(d,14,5)+"us.midlere verdi  " + n+" ganger"+ll);

 		    //Convert double to long RawBit
		   		  s ="Double to longRaw         ";
		   		   db = new double[n];
		   		    r = new Random(123);
		   		    m=0;

		   		   for (int i = 0; i<n; i++) {
		   			   db [i]= r.nextDouble();
		   		   }
		   		  ll=0;

		            t = System.nanoTime();
		   		  for (int i = 0; i<n; i++) {
		  			   //t = System.nanoTime();
		   				ll = Double.doubleToRawLongBits(db[i]);
		   		  }
		  		  m = (System.nanoTime() -t);
		  		  if (m == 0) println("ERR m 0");
		  		  d = (double) (m/(n*1000.0));
 		  println(s+Format.align(d,14,5)+"us.midlere verdi  " + n+" ganger"+ll);


 	     //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];
 		   }
          m=0;
 		  for (int i = 0; i<=n; i++) {
			    System.arraycopy(db2,0,db,0,len);
			    t = System.nanoTime();
 				 insertSort1(db,0,len-1);
 				 m += (System.nanoTime() -t);
 		  }
		  //m = (System.nanoTime() -t);
		  if (m == 0) println("ERR m 0");
		  d = (double) (m/(n*1000.0));
 		  println(s+Format.align(d,12,3)+"us.midlere verdi  " + 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