Diff b/w linked& array list

Answer 1

http://lmgtfy.com/?q=linked+list+vs+array+list+java

Answer 2

https://www.sololearn.com/Discuss/839853/?ref=app

Answer 3

Hey swetha .I'm Tamil, pondicherry

Answer 4

➡ArrayList uses a dynamic resizable array. LinkedList uses doubly linked list data structure.

➡ArrayList is not efficient for manipulation because a lot of shifting is required. LinkedList is efficient for manipulation.

➡ArrayList is better to store and fetch data. LinkedList is better to manipulate data.

➡ArrayList allow random access, so you can grab any element in constant time. But adding or removing from anywhere but the end requires shifting all the latter elements over, either to make an opening or fill the gap. LinkedList allows for constant-time insertions or removals, but only sequential access of elements. In other words, you can walk the list forwards or backwards, but grabbing an element in the middle takes time proportional to the size of the list.