public class SortedNumberList extends NumberList // extend NumberList so that values are in sorted order - this requires modifying add, we can also make find more efficient
{								// no new instance data
   	public SortedNumberList() 	// call no-arg constructor of SortedNumberList since no change to instance data
   	{
   		super();
   	}
   
   	public SortedNumberList(int size)		// call 1-arg constructor
   	{
   		super(size);
   	}
   	
   	@Override
   	public int find(int x) 		// this find is more efficient because if we find a value list[i] > x then we know x is not in the list and we can return -1 at that point
   	{
		for(int i=0;list[i]<x&&i<number;i++)
  	   		if(list[i]==x) return i;
		return -1;
   }
   
   @Override
   public void add(int x)		// since add needs to insert in order, we re-implement this method, rather than adding at the end, we have to shift elements up to insert x
   {
		int i=0,j;
		if(number<max) 			// only allow the insert if room in the array
		{
	   		while(i<number&&list[i]<x)	// find proper location to insert
				i++;
	   		for(j=number-1;j>=i;j--)	// shift all elements from i up 1 position
				list[j+1]=list[j];
	   		list[i]=x;					// place x in vacated spot
	   		number++;
		}
   }
}