i would rather suggest vector for "FAST SEQUENTIAL ACCESS" as Vector contain elements in contiguous memory locations...so cache locality is good in case of it.... as in case of Singly Linked List or Doubly Linked List,, cached locality is not good,, Sequntial access would not be fast in a long run..
On Thu, Nov 22, 2012 at 1:12 PM, atul anand <[email protected]> wrote: > @shady : as subject says "fastest sequential access " , then if i am not > getting it wrong.we only care of sequential access a value not modifying > the linked list. > so i guess double linked list would be helpful > 1) bcozz it can move in both the direction , so if linked list is sorted > then it would be a great help > 2) if you want to insert element at the end of linked list then if will be > better than vector > so i guess it required 1-2 more parameter to decide ,which one to use. > > On Wed, Nov 21, 2012 at 8:21 PM, shady <[email protected]> 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....... >> >> -- >> >> >> > > -- > > > -- *ATul Singh** Software Engineer**, Interra Systems* Mobile : +91-9410826039 www.interrrasystems.com [image: Facebook] <http://www.facebook.com/atulsingh7890> [image: Twitter]<http://www.twitter.com/atulsng> [image: LinkedIn] <http://www.linkedin.com/in/atulsingh7890> --
