public class Student {
    public String name;     // student's name, 
    public int year;        //           class year,
    public int subox;       //           S.U. Box number, and
    public String email;    //           e-mail address
    
    // This method determines whether or not a student's name
    // alphabetically precedes the name of another student (t), 
    // and returns true or false accordingly.
    public boolean precedes (Student t) {
       if (name.compareTo(t.name) < 0)
          return true;
       else return false;
    }
}

public class ourClass {

    // This is similar to the method swap on page 230, except that we're
    // dealing with an array of Student records, rather than doubles.
    public static void swap(Student[] s, int i, int j) {  


    }
    
    // this is also similar to the method findMinimum on page 230, and it 
    // needs no additional code.
    public static int findMinimum(Student[] s, int i, int n) {
        int j, min = i;
        for (j=i+1; j<n; j++)
           if (s[j].precedes(s[min]))
              min = j;
        return min;
    }
    
    // a new method for searching a Student array should be added here.  It
    // may be styled after the linear search method on p 231 of your text.

	public static void main(String args[]) {

		// The next line sets up a 'pseudo Keyboard' so that you don't
		// have to type input every time you run the program.  The
		// text  file on disk is named "directory".  The class pseudoKeyboard
		// contains the same methods as does the class Keyboard, except that
		// it takes data from the text file rather than the user's keyboard.
		// To read data from this file, you need to say things like
		//      int j = dataFile.readInt();  rather than
		//      int j = Keyboard.readInt();
		// To use this class, be sure to include the pseudoKeyboard.java file
		// in your project.
		pseudoKeyboard dataFile = new pseudoKeyboard("directory");

	    Student[] s = new Student[100]; // construct an array of student records 
        int nStudents;                  // and a count of how many there are
    
		int i = 0;		
		s[i] = new Student();       // construct a new student record
		s[i].name = dataFile.readString();   // read the first student
		while (!dataFile.eof()) {
		   s[i].year = dataFile.readInt();
		   s[i].subox = dataFile.readInt();
		   s[i].email = dataFile.readString();
		   i = i + 1;
   		   s[i] = new Student();    // construct another student record
		   s[i].name = dataFile.readString(); // read the next student
		}
		nStudents = i;
		System.out.println( nStudents + " student records were read\n");
	    for (i=0; i<nStudents; i++) {
	        System.out.println(s[i].name + " " + s[i].year + " " + 
	                           s[i].subox + " " + s[i].email);
	    }
	    
	    // Now sort the file by student name and display the records again
	    // using the insertion sort strategy on page 229.  Here, we're sorting
	    // student records rather than floats, but the logic is the same.
	    for (i=0; i<nStudents; i++) {


	    }
	    // Now display the sorted records
		System.out.println("\n\nThe sorted records are");
	    for (i=0; i<nStudents; i++) {
	        System.out.println(s[i].name + " " + s[i].year + " " + 
	                           s[i].subox + " " + s[i].email);
	    }
	    // Now develop and display a histogram of the number of students in each
	    // class year -- 1999, 2000, 2001, and 2002.  To do this, you first need
	    // adapt the file Histogram.java from its current use and add it to the
	    // project.  See pp 223-224 in your text for a discussion of these ideas.
	    
	    // Now prompt the user to enter an SU Box number; your program
	    // should find that Box number in the array s and display that
	    // person's name, class, and e-mail address.  To find that Box number,
	    // your program may use a linear search, as discussed on page 231. 
	    // If there's noone with that box number, an appropriate message should 
	    // be displayed.  This process should be repeated until the user enters 
	    // ctrl-d to signal the end of the run.	    
	}
}