java - Is it more efficient to remove elements from an ArrayList or a LinkedList?

In theory, is it more efficient to remove elements from an ArrayList or a LinkedList?

Answer

It is "easier" (that is, more efficient) to remove them from a LinkedList, because removal from an ArrayList requires moving all subsequent elements to a new position in the list—all subsequent elements of the array must be assigned a new value. With a linked list, only one pointer (or two, with a doubly-linked list) must be re-assigned.