import Myro.*;

public class ArrayPratice
{
    private int[  ] myNumbers = new int[100];
    private static final int INITIALNUM = 10;
    private int top = 0;
    
    //Initialize a sorted array. It will have INITIALNUM elements.
    //top will have the value of the first uninitialized element
    public ArrayPratice()
    {
        System.out.println();
        System.out.println();
        for (int i=0; i<INITIALNUM; i++)
        {
            myNumbers[i] = MyroUtils.randomInt(i*10+1, (i+1)*10-1);
            top++; 
        }
    }

    //print out an array, from 0 up to top-1
    public void printArray()
    {
        for (int i=0; i<top; i++)
        {
            System.out.println(i + ": " + myNumbers[i]);
        }
    }
    
    //Add a number, toAdd, into the first empty spot in the array
    //(position top).
    //top will increase by one
    //return true iff successful
    //Assume array is UNSORTED
    public boolean insertLast(int toAdd)
    {
        return false;   
    }
    
    //Add a number, toAdd, into the first spot in the array
    //(position 0).
    //top will increase by one
    //all other array elements will shift upwards
    //return true iff successful
    //Assume array is UNSORTED
    public boolean insertFirst(int toAdd)
    {
        return false;
    }

    //Return the index of the first occurance of the number
    //toFind in the array. If it does not appear in the 
    //array, return -1
    //Assume array is UNSORTED
    public int findElt(int toFind)
    {
        return -1;
    }

    //Remove the first occurance of the number
    //toFind from the array. If successful, return
    //true. If the number is not found, return false.
    //Assume the array is SORTED
    public boolean removeElt(int toFind)
    {
        return false;
    }

    //Remove the number toFind to the array. 
    //Iff successful, return true. 
    //Assume the array is SORTED
    public boolean addElt(int toFind)
    {
        return false;
    }

}