/*

*/
public class MyArrayList<Type extends Comparable<Type>> {

private int capacity = 16;
private int size = 0;
private Type[] list = (Type[]) new Comparable[capacity];

public long comparisons;

public void insert(Type item, int index) {
   if (index >=0 && index <= size) {
         if (size == capacity) {
            resize();
         }
         for (int i=capacity-1; i>index; i--){
            list[i] = list[i-1];
         }
         list[index] = item;
         this.size++;
   }
}

public Type remove(int index) {
   if (index >= 0 && index < this.size){
         Type item = list[index];
         for (int i=index; i<size-1; i++) {
            list[i] = list[i+1];
         }
         this.size--;
         return item;
   }
   return null;
}

public boolean contains(Type item) {
   for (int i=0; i<size; i++) {
         comparisons++;
         if (list[i].compareTo(item) == 0) {
            return true;
         }
   }
   return false;
}

public int indexOf(Type item) {
   for (int i=0; i<size; i++) {
         if (list[i] != null && list[i].compareTo(item) == 0) {
            return i;
         }
   }
   return -1;
}

public Type get(int index) {
   if (index >=0 && index < this.size) {
         return list[index];
   }
   return null;
}

public void set(int index, Type item) {
   if (index >=0 && index < this.size) {
         list[index] = item;
   }
}

public int size() {
   return this.size;
}

public boolean isEmpty() {
   return size()==0? true: false;
}

public String toString() {
   String result = "[";
   for (int i=0; i< this.size; i++) {
         if (list[i] != null) {
            result += list[i];
         }
         if (i < this.size-1) {
            result += ", ";
         }
   }
   result += "]";
   return result;
}

private void resize() {
   Type[] newList = (Type[]) new Comparable[capacity*2];
   System.arraycopy(list, 0, newList, 0, capacity);
   this.capacity *= 2;
   this.list = newList;
}

public void sort() {
   if (this.list != null) {
         int N = this.size();
         for (int i=1; i < N; i++) {
            Type key = list[i];
            int j = i-1;
            while (j >= 0 && list[j].compareTo(key) > 0) {
               list[j+1] = list[j];
               j = j - 1;
            }
            list[j + 1] = key;
         }
   }
}
}

Open Data Structures in Java This is an assignment with java prog...