myList.java

import java.util.*;

public class myList {
    private int[] data;
    private int numItems;
    
    public myList() {
	data = new int[5];
	numItems=0;
    }

    public boolean isFull() {
	return numItems >= data.length;
    }

    public void grow() {
	    // "grow" the array by creating a new one and copying over
	    int[] tmpArray = new int[data.length+data.length/2];
	    for (int i=0;i<data.length;i++) 
		tmpArray[i]=data[i];
	    data = tmpArray;
    }

    public void add(int d) {
	if (isFull()){
	    grow();
	}
        data[numItems]=d;
        numItems = numItems + 1;
    }
    
    public String toString() {
	String s = Arrays.toString(data)+" : "+numItems;
	return s;
    }
	
    public void add(int pos, int d) {
	if (isFull()){
	    grow();
	}
	if (pos > data.length){
	    System.out.println( "That index is greater than the size of the array");
	    System.exit(0);
	}
	for(int i = numItems;i>pos;i--){
	    data[i] = data[i - 1];
	}
	data[pos] = d;
	numItems++;
		// to be completed by you
		// inserts the value d at location (index) pos)
		// recall the algorithm we developed in calss:
		// 1. Grow if needed
		// 2. shift everything past the insertion point down
		// 3. add the new item
		// 4. numitems++
	}

    public void remove(int pos) {
	for(int i = pos;i<data.length-1;i++){
	    data[i] = data[i + 1];
	}
	numItems = numItems - 1;
    }
		// removes the item at location pos
		// 1. shift everything down to remove the item
		// 2. numitems--
	public int size() {
	    return numItems;
		// return the number of items in the list
	}
	public int get(int pos) {
	    return data[pos];
		//return the item at pos;
	}
	public void set(int pos, int d) {
	    data[pos] = d;
		// change the item at pos to have the value d
	}
     public int find(int n) {
	for (int i=0;i<numItems;i++) {
	    if (data[i]==n)
		return data[i];
	}
	return 0;
    }
    
    public int fremove(int n) {
	for (int i=0;i<numItems;i++) {
	    if (data[i]==n) {
		int result = data[i];
		remove(i);
		return result;
	    }
	}
	return 0;
    }
}