ArrayList vs LinkedList in Java

Study Notes

An array is a collection of items stored in contiguous memory locations
ArrayList and LinkedList are classes implemented to solve the limitation of the array's fixed size
ArrayList is part of the collection framework and provides dynamic arrays in Java
LinkedList is a linear data structure where elements are linked using pointers and addresses
ArrayList has fast indexed access time but can be slow when inserting or deleting elements from the middle
LinkedList does not use an array to store its elements and is preferred for dynamicity and ease of insertions and deletions
Each element in a LinkedList is represented by a node that contains a reference to the data stored in the node and a reference to the next node in the list
Retrieving elements from an ArrayList by an index is very quick
Inserting or deleting elements from the middle of an ArrayList can be slow as the entire array needs to be shifted in memory
Each element in a LinkedList is a separate object with a data part and an address part