CpSc 102, Section 1
                             Assignment 2 
                             May 29, 2000 


Due: Tuesday, June 5 by 11:59 p.m.

Assignment:  Problem 7 on page 239  


Total point value of assignment:  100 points
Not accepted late.

This assignment is to be done INDIVIDUALLY.



Create a file, A2.java, which will contain at least a main method and the following method:



        public IntNode listSort ( IntNode head )
        // post:  The return value is a head reference of a linked list with 
        //        exactly the same entries as the original list (including
        //        repetitions, if any), but the entries in this list are
        //        sorted from smallest to largest.  The original linked list is
        //        no longer available.




You are to use selection sort in this problem.  The algorithm is given in the problem statement on page 239.



Your main method should (as usual) contain a test program, containing several test situations.  A2.java may contain any additional methods that would be helpful.  For example, you might write a method to print out "CPSC 102", your name, the assignment number, and a brief description of the assignment.




Other requirements:

    The first operation of your main program must be to print "CPSC 102", your name, the assignment number, and a brief description of the assignment.




	Follow the style standards to be found on your instructor's
	web page for CPSC 102.

	Submit your program using the handin command.  There is a link to
	the handin description on the CPSC 210 lab page (www.cs.clemson.edu/~lab210).

Grading rubric:

	In the opinion of the instructor the program is an honest attempt
		to complete the assignment as described  5 pt.

	The program compiles without error.  10 pts.

	If the two previous requirements are not substantially met, no further 
	points will be awarded.

    Correctness, documentation, and style.  85 pts.
    Points will be subtracted for failure to follow style standards.