A Sorted Integer List File IntList.java contains code for an integer list class.

A Sorted Integer ListFile IntList.java contains code for an integer list class. Save it to your directory and study it; notice that the only things you can do are create a list of a fixed size and add an element to a list. If the list is already full, a message will be printed. File ListTest.java contains code for a class that creates an IntList, puts some values in it, and prints it. Save this to your directory and compile and run it to see how it works. Now write a class SortedIntList that extends IntList. SortedIntList should be just like IntList except that its elements shouldalways be in sorted order from smallest to largest. This means that when an element is inserted into a SortedIntList it should be put into its sorted place, not just at the end of the array. To do this you’ll need to do two things when you add a new element: • Walk down the array until you find the place where the new element should go. Since the list is already sorted you • Move down every element that will go after the new element, that is, everything from the one you stop on to the end. This creates a slot in which you can put the new element. Be careful about the order in which you move them or you’ll overwrite your data! Now you can insert the new element in the location you originally stopped on. All of this will go into your add method, which will override the add method for the IntList class. (Be sure to also check to To test your class, modify ListTest.java so that after it creates and prints the IntList, it creates and prints a SortedIntListcontaining the same elements (inserted in the same order). When the list is printed, they should come out in sorted order. // **************************************************************** // IntList.java // // An (unsorted) integer list class with a method to add an // integer to the list and a toString method that returns the contents // of the list with indices. // **************************************************************** public class IntList { protected int[] list; protected int numElements = 0; //------------------------------------------------------------- // Constructor -- creates an integer list of a given size. //------------------------------------------------------------- public IntList(int size) { list = new int[size]; } //------------------------------------------------------------- // Adds an integer to the list. If the list is full, // prints a message and does nothing. //------------------------------------------------------------- public void add(int value) { if (numElements == list.length) System.out.println("Can't add, list is full"); else { list[numElements] = value; numElements++; Chapter 8: Inheritance 157 } } //------------------------------------------------------------- // Returns a string containing the elements of the list with their // indices. //------------------------------------------------------------- public String toString() { String returnString = ""; for (int i=0; i<numElements; i++) returnString += i + ": " + list[i] + "n"; return returnString; } } // **************************************************************** // ListTest.java // // A simple test program that creates an IntList, puts some // ints in it, and prints the list. // **************************************************************** public class ListTest { public static void main(String[] args) { IntList myList = new IntList(10); myList.add(100); myList.add(50); myList.add(200); myList.add(25); System.out.println(myList); } }