Performance with LinkedList in java

Question

Hello All,
Please suggest me any solution to further improve the performance with List.
The problem description is as follows:
I have a huge number of objects, lets say 10,000 , and need to store the objects in such a collection so that if i want to store an object at some particular index i , I get the best performance.
I suppose as I need indexed based access, using List makes the best sense as Lists are ordered.
Using LinkedList over ArrayList gives the better performance in the aforementioned context.
Is there are way I can further improve the performance of LinkedList while solving this particular problem
OR
Is there any other index based collection using that i get better performance than LinkedList?
Thanks in advance

Answer 1

The trouble with a LinkedList as implemented in the Java libraries is that if you want to insert at index 100, it has no option but to step through the first 100 links of the list to find the insert point. Likewise is you retrieve by index. The strength of the linked list approach is lost if you work by index and the List interface gives no other way to insert in the middle of the list. The natural interface for a linked list would include an extended Iterator with methods for insert and replace. Of course LinkedLists are fine when you insert first or last.
My guess would be that if your habitual insertion point was half way or more through the list then ArrayList would serve you better especially if you leave ample room for growth. Moving array elements up is probably not much more expensive, per element, than walking the linked list. Maybe 150% or thereabouts.
Much depends on how you retrieve, and how volatile the list is. Certainly if you are a read-mostly situation and cannot use an iterator then a LinkedList won't suit.