// 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 to test the permute and largest functions
class Permutemain {

// A version of "largest" that uses Elem's instead of ints.
// The book version (largest.txt) uses int's since at that
// point in the text, the Elem class and the key method had
// not been defined.
static int largestE(Elem[] array) {   // Find largest value
  int currLargest = 0;               // Store largest value
  for (int i=0; i<array.length; i++) // For each array element
   if (array[i].key() > currLargest) //   if this is largest
      currLargest = array[i].key();  //     remember it
  return currLargest;                // Return largest value
}

// Here is the version that appears in the book.
// It should be nearly identical to largestE.
static int largest(int[] array) {    // Find largest value
  int currLargest = 0;               // Store largest value
  for (int i=0; i<array.length; i++) // For each array element
   if (array[i] > currLargest)       //   if this is largest
      currLargest = array[i];        //     remember it
  return currLargest;                // Return largest value
}

  // Main function for permute/largest test
  public static void main(String args[]) throws IOException {
    Assert.notFalse(args.length == 1, "Usage: Permutemain <size>");
    int size = Integer.parseInt(args[0]);  // Get size
    Elem[] A = new Elem[size];  // Create an array

    for (int i=0; i<size; i++) // Stick in some values
      A[i] = new IElem(i);

    DSutil.permute(A); // Permute the values

    // Now, find the largest value
    for (int i=0; i<size; i++) {
      System.out.print(A[i].key());
      if (((i+1)%10) == 0)
        System.out.println();
      else
        System.out.print("  ");
    }
    System.out.println();

	System.out.println("The largest element has key " +
		               largestE(A));

    System.in.read();
  }

}