Array List Implementation in JAVA

Write a program to implement your own ArrayList class. It should contain add(), get(), remove(), size()  methods. Use dynamic array logic. It should increase its size when it reaches threshold.

 import java.util.Arrays;

public class MyArrayList {

        

    private Object[] myStore;

    private int actSize = 0;

    

    public MyArrayList(){

        myStore = new Object[10];

    }

    

    public Object get(int index){

        if(index < actSize){

            return myStore[index];

        } else {

            throw new ArrayIndexOutOfBoundsException();

        }

    }

    

    public void add(Object obj){

        if(myStore.length-actSize <= 5){

            increaseListSize();

        }

        myStore[actSize++] = obj;

    }

    

    public Object remove(int index){

        if(index < actSize){

            Object obj = myStore[index];

            myStore[index] = null;

            int tmp = index;

            while(tmp < actSize){

                myStore[tmp] = myStore[tmp+1];

                myStore[tmp+1] = null;

                tmp++;

            }

            actSize--;

            return obj;

        } else {

            throw new ArrayIndexOutOfBoundsException();

        }

        

    }

    

    public int size(){

        return actSize;

    }

    

    private void increaseListSize(){

        myStore = Arrays.copyOf(myStore, myStore.length*2);

        System.out.println("\nNew length: "+myStore.length);

    }

}