// Source code example for "A Practical Introduction
// to Data Structures and Algorithm Analysis"
// by Clifford A. Shaffer, Prentice Hall, 1998.
// Copyright 1998 by Clifford A. Shaffer

import java.io.*;

// Driver class for a simple binsort
class Binsimpmain {

  // Main routine for a simple binsort
  public static void main(String args[]) throws IOException {
    Assert.notFalse(args.length == 2, "Usage: Binsimpmain <size> <cycles>");
    int n = Integer.parseInt(args[0]);
    int cycles = Integer.parseInt(args[1]);
    int i, j;

    Elem[] A = new Elem[n];

    for (i=0; i<n; i++)
      A[i] = new IElem(i);

    Elem[] B = new Elem[n];
    Elem[] temp = new Elem[n];

    for (i=0; i<n; i++)
      B[i] = new IElem();

    DSutil.permute(A);

    for (i=0; i<n; i++)
      temp[i] = A[i];

    System.out.println("Initial permutation:");

    for(i=0; i<n; i++)
      System.out.print(A[i].key() + "  ");
    System.out.println();

    System.out.println("Do binsimp1");

/// binsimp1: Optimized for time
for (i=0; i<n; i++)
  B[A[i].key()] = A[i];
/// End binsimp1.x

System.out.println("Do binsimp2");

/// binsimp2: Optimized for space
for (i=0; i<n; i++)
  while (A[i].key() != i) // Swap element A[i] with A[A[i].key()]
    DSutil.swap(A, i, A[i].key());
/// End binsimp2.x

    System.out.println("Now, what is temp?");
    for (i=0; i<n; i++)
      System.out.print(temp[i].key() + " ");
    System.out.println();

    System.out.println("Let's check to be sure this works.");
    for(i=0; i<n; i++)
      System.out.print(A[i].key() + "  ");
    System.out.println();
    for(i=0; i<n; i++)
      System.out.print(B[i].key() + "  ");
    System.out.println();

    System.out.println("OK, now for timings.");
    System.out.println("Test for " + cycles + " cycles");

    long time1 = System.currentTimeMillis();
    for (j=0; j<cycles; j++)
      for (i=0; i<n; i++)
        B[A[i].key()] = A[i];
    long time2 = System.currentTimeMillis();
    System.out.println("Time for binsimp1 is " + (time2-time1));

    // Factor out overhead
    time1 = System.currentTimeMillis();
    for (j=0; j<cycles; j++)
      for (i=0; i<n; i++)
        A[i] = temp[i];
    time2 = System.currentTimeMillis();
    long temptime = time2-time1;
    System.out.println("Overhead time is " + (time2-time1));

    time1 = System.currentTimeMillis();
    for (j=0; j<cycles; j++) {
      for (i=0; i<n; i++)
        A[i] = temp[i];

      for (i=0; i<n; i++)
        while (A[i].key() != i) // Swap element A[i] with A[A[i].key()]
          DSutil.swap(A, i, A[i].key());
    }
    time2 = System.currentTimeMillis();
    System.out.println("Raw time is " + (time2-time1));
    System.out.println("Time for binsimp2 is " + (time2-time1-temptime));

    System.in.read();
  }
}