Would someone explain why I'm getting better results with inserting to ArrayList list than to LinkedList? Is that some compiler optimization? Using Java 1.6.0 u27. LinkedList is implemented using doubly linked list as internal data structure. LinkedList is a class that extends the AbstractSequentialList and implements List, Deque, Queue interfaces, which internally uses a doubly linked list to store data elements. You may want to have a look at which introduces GapList which strives for combining the strengths of both ArrayList and LinkedList. ArrayList is a class that extends the AbstractList and implements the List interface which internally uses a dynamic array to store data elements. LinkedList vs ArrayList, ArrayList vs LinkedList, ArrayList and LinkedList in Java, LinkedList and ArrayList in Java, Differnece between ArrayList and LinkedList, Difference between LinkedList and ArrayList, What is difference between LinkedList and ArrayList, When to use LinkedList and When to use ArrayList, LinkedList and Array in Java Difference between Linked List and Array is different from the another popular core java interview question difference between ArrayList and LinkedList in. I prefer to use ArrayList or Vector but never used LinkedList. If any element is removed from the array, all the bits are shifted in memory.

2) Manipulation with ArrayList is slow because it internally uses an array. LinkedList internally uses a doubly linked list to store the elements.

Another difference between LinkedList and ArrayList is that ArrayList is index based while LinkedList is not. ArrayList LinkedList 1) ArrayList internally uses a dynamic array to store the elements.

Linkedlist vs array vs arraylist