ArrayList vs LinkedList !!

[Gunjan Rathi]

What are the differences between an ArrayList and a LinkedList ?
Where do we use ArrayList and where LinkedList ?

[Jesper de Jong]

ArrayList is implemented with an array to store the elements of the list. LinkedList is implemented as a doubly-linked list.

Which one you should use depends on how you use the list. An ArrayList is faster when you need to lookup an element at a known index in the list, but slower when you insert elements in the list. A LinkedList is slower when looking up an element at a known index in the list, but faster when you insert elements in the list.

[Raghavan Muthu]

Adding on top of what Jesper said, both of them are collections and used to deal with a heterogeneous elements in a sequence.

As they follow different implementation strategies, they have different characteristics. I think Jesper have given a good explanation on that.

[Amir Alagic]

http://narencoolgeek.blogspot.com/2006/09/arraylist-vs-linkedlist.html

[Raghavan Muthu]

Originally posted by Amir Alagic:
http://narencoolgeek.blogspot.com/2006/09/arraylist-vs-linkedlist.html

This link is cool (also the links present inside the article).

[raghu nagabandi]

ArryList: we will use ArrayList in following cases
if the requirement contains more retrival operation then we have to use ArrayList

LinkedList: If the requirement contains more insertions and deletions then we will use LinkedList

[Ilja Preuss]

Originally posted by raghu nagabandi:
ArryList: we will use ArrayList in following cases
if the requirement contains more retrival operation then we have to use ArrayList

Only for random access. If we always iterate through all elements of a list in order, a LinkedList should be just fine (although still a little bit slower).