This is an implementation-specific issue, and will vary between languages and container libraries. Some responders have mentioned that vectors are synced, which makes them slower. That's true in Java. Not true in C++. Certainly not true in C. The only way to know for sure which is faster is to run a benchmark with the candidate containers on the intended system.
Don On Nov 21, 9:52 am, shady <sinv...@gmail.com> wrote: > which data structure among the follow has fastest sequential access ? > i) vector > ii) Singly linked list > iii) Doubly linked list > > it won't be doubly linked list as it involves more pointer manipulations > than singly linked list....... --
