ArrayList internally uses a dynamic array to store its elements. LinkedList uses Doubly Linked List to store its elements . ArrayList is slow as array manipulation is slower. LinkedList is faster being node based as not much bit shifting required.
ArrayList internally uses a dynamic array to store its elements. LinkedList uses Doubly Linked List to store its elements . ArrayList is slow as array manipulation is slower. LinkedList is faster being node based as not much bit shifting required.