Neha Daga wrote:now you know, why so many people noticed you were missing
Ankit Garg wrote:When you iterate over elements sequentially, ArrayList is slower than LinkedList.
Ankit Garg wrote:When you iterate over elements sequentially, ArrayList is slower than LinkedList. ArrayList is faster in random access of elements, LinkedList is slow in that...
Ankit Garg wrote:Someone did some extensive experimentation on this here. The results are interesting...
Ankit Garg wrote:seetharaman, how many times did you execute that code??
Ankit Garg wrote:But if I increase the elements in the List, i.e. from 3 to around 30, most of the times LinkedList was faster
Simran Dass wrote: a) What do you mean by iteration in Collections ? Does it mean using specifically an ITERATOR or it can also mean using a for loop(or for that matter any loop) to access the elements one by one.
Wouter Oet wrote:A. Not all collections have an iterator. A HashMap for instance doesn't.
Manish Awasthy wrote:among linked list and vector ,Linked list performs better because the methods of linked list are asynchronous where as methods of vector are synchronized
Wouter Oet wrote:A Vector uses synchronization and a LinkedList doesn't so there is a big difference in functionality so you're comparing apples and pears.
Simran Dass wrote:
There was a question in ExamLab ...
[color=darkblue] LinkedList iterates faster than Vector - True or False.[color]
What should be my answer ?
Simran Dass wrote: [color=darkblue] LinkedList iterates faster than Vector - True or False.[color]
Also, I suggest replacing the second "[ color ]" with "[ / color ]". Omit the spaces.
Mike Simmons wrote:I know how to look up ASCII codes when I'm being paid to do so.....Making things look pretty is not my concern.
Ankit Garg wrote:If you felt so
Ankit Garg wrote:if that's what you were thinking...