468,294 Members | 1,894 Online
Bytes | Developer Community
New Post

Home Posts Topics Members FAQ

Share your developer knowledge by writing an article on Bytes.

How to implement ArrayList data structure in Java

package com.ds.algorithms.arraylist;

* @Author pankaj
* @create 4/10/21 6:37 PM
Why to use ArrayList:
is a re-sizable array, also called a dynamic array(Growable array/ resizable Array). It grows its size to accommodate new elements and
shrinks the size when the elements are removed.
---> ArrayList internally uses an array to store the elements. Just like arrays, It allows you to
retrieve the elements by their index
ArrayList is an implementation class for List interface.
Adv of List:
1. duplicates are allowed.
2. Insertion Order is preserved. the way you are going to insert the elements , in the same way you element will be displayed
3. default capacity of arrayList is 10
4. Formula to grow ArrayList= CC*3/2+1 till java 1.6
5. Once new ArrayList got created the older arraylist will be eligible fo GC
6. null insertion is possible in AL
7. homogeneous elements are allowed
NOTE: INTER DS of ArrayList is Dynamic array/Growable array/ resizable Array
-------------When to use ArrayList ----------------------
1. ArrayList is bad Choice for inserting/ deleting element in the middle of AL because it will take more time to shift element
Noe: If you have Frequent insertion/ deletion operation in middle of List best choice to use LL over AL
2.. If your frequent operation is retrieval operation ArrayList is Best Choice.
3. ArrayList and Vector class implements RandomAccess interface, helps you to retrieve element in constant time O(1) irrespective of index
Note: RandomInterface is marker interface(don't have any method)

public class ArrayListCode {

private static final int INITIAL_CAPACITY=10;
private Object [] objectArray;
private int index;
private int size;
this.objectArray=new Object[INITIAL_CAPACITY];

public void add(Object o)
System.out.println("index: "+this.index+" size: "+this.size+" Array size: "+this.objectArray.length);
//check whether array is full
if(this.index== this.size-1)
// Object array is full, in this case we need to increase Object Array
// array is not full
private void increaseObjectArray()
//create new Object array and copy from older Array
Object[] newObjectArray=new Object[this.size];
for (int i=0;i<objectArray.length;i++)
System.out.println(" ####### index ###### : "+this.index+" size : "+this.size+" array size : "+this.objectArray.length);

// code to get()
public Object get(int i) throws Exception
// data index is not present in array
if(i>this.index -1)
throw new Exception("ArrayIndexOutOfBoundsException");
} //-ve index is passed
else if(i<0)
throw new Exception("negative value !!!");
return this.objectArray[i];
// method to remove or delete element
public void remove(int i) throws Exception {
throw new Exception("ArrayIndexOutOfBoundsException !!!");
} else if(i<0)
throw new Exception("Negative Index !!!");
// code to delete object from array
System.out.println("Object is deleted "+this.objectArray[i]);
for (int j=0;j<objectArray.length-1;j++)
}// decrease index by one after deletion of object

public static void main(String[] args) throws Exception {
ArrayListCode myArrayList=new ArrayListCode();
myArrayList.add("Ravi Kumar");
System.out.println("Print address ::::::::: "+myArrayList);
System.out.println("index 9th element "+myArrayList.get(9));
System.out.println("index 11th element "+myArrayList.get(11));
System.out.println("index 12th element "+myArrayList.get(12));
/* We can handle Error by using try catch or,. directly throw Exception from main method
try {
}catch (Exception e){ }*/
4 Weeks Ago #1
0 3504

Post your reply

Sign in to post your reply or Sign up for a free account.

Similar topics

5 posts views Thread by Saravanan Rathinavelu | last post: by
1 post views Thread by Bill Mill | last post: by
4 posts views Thread by sakcee | last post: by
16 posts views Thread by ravi | last post: by
1 post views Thread by jainyi | last post: by
5 posts views Thread by =?Utf-8?B?c2lwcHl1Y29ubg==?= | last post: by
3 posts views Thread by eisman28 | last post: by
reply views Thread by NPC403 | last post: by
reply views Thread by Teichintx | last post: by
By using this site, you agree to our Privacy Policy and Terms of Use.