OrderedArrayList.java

/*============================================
   class OrderedArrayList
   Wrapper class for ArrayList.
   Imposes the restriction that stored items 
   must remain sorted in ascending order
   ============================================*/

//ArrayList's implementation is in the java.util package
import java.util.ArrayList;


public class OrderedArrayList {

    // instance of class ArrayList, holding objects of type Comparable 
    // (ie, instances of a class that implements interface Comparable)
    private ArrayList<Comparable> _data;


    // default constructor initializes instance variable _data
    public OrderedArrayList() {
	// *** YOUR IMPLEMENTATION HERE ***
    }


    public String toString() { 
	// *** YOUR IMPLEMENTATION HERE ***
	return ""; //placeholder
    }


    public Comparable remove( int index ) { 
	// *** YOUR IMPLEMENTATION HERE ***
	return ""; //placeholder 
    }


    public int size() { 
	// *** YOUR IMPLEMENTATION HERE ***
	return -1; //placeholder 
    }

    
    public Comparable get( int index ) { 
	// *** YOUR IMPLEMENTATION HERE ***
	return ""; //placeholder  
    }


    // addLinear takes as input any comparable object 
    // (i.e., any object of a class implementing interface Comparable)
    // inserts newVal at the appropriate index
    // maintains ascending order of elements
    // uses a linear search to find appropriate index
    public void addLinear(Comparable newVal) { 
	// *** YOUR IMPLEMENTATION HERE ***
    }


    // addBinary takes as input any comparable object 
    // (i.e., any object of a class implementing interface Comparable)
    // inserts newVal at the appropriate index
    // maintains ascending order of elements
    // uses a binary search to find appropriate index
    public void addBinary(Comparable newVal) { 
	// *** YOUR IMPLEMENTATION HERE ***
    }	


    // main method solely for testing purposes
    public static void main( String[] args ) {

	/* ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
	OrderedArrayList Franz = new OrderedArrayList();

	// testing linear search
	for( int i = 0; i < 15; i++ )
	    Franz.addLinear( (int)( 50 * Math.random() ) );
	System.out.println( Franz );

	// testing binary search
	Franz = new OrderedArrayList();
	for( int i = 0; i < 15; i++ ) 
	    Franz.addBinary( (int)( 50 * Math.random() ) );
	System.out.println( Franz );
	   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*/
    }

}//end class OrderedArrayList