In theory, 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
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
In theory, is it more efficient to remove elements from an ArrayList or a LinkedList?
It is “easier” (that is, more efficient) to remove them from a
LinkedList, because removal from anArrayListrequires 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.