Difference between ArrayList and LinkedList

ArrayList	LinkedList
1) ArrayList internally uses dynamic array to store the elements.	LinkedList internally uses doubly linked list to store the elements.
2) Manipulation with ArrayList is slow because it internally uses array. If any element is removed from the array, all the bits are shifted in memory.	Manipulation with LinkedList is faster than ArrayList because it uses doubly linked list so no bit shifting is required in memory.
3) ArrayList class can act as a list only because it implements List only.	LinkedList class can act as a list and queue both because it implements List and Deque interfaces.
4) ArrayList is better for storing and accessing data.	LinkedList is better for manipulating data.

Example:-
 Public Class MyClass{
public static void main(String args[])
{
List<String> MyList=new ArrayList<String>();   //creating arraylist    
MyList.add(“Ravi”);        //Adding object in arraylist    
MyList.add(“Vijay”);
MyList.add(“Ravi”);
MyList.add(“Ajay”);
List<String> MyList2=new LinkedList<String>();       //creating linkedlist    
MyList2.add(“James”);     //adding object in linkedlist   
MyList2.add(“Serena”);
MyList2.add(“Swati”);
MyList2.add(“Junaid”);
System.out.println(“arraylist: “+MyList);
System.out.println(“linkedlist: “+MyList2);                                                                                            }

}