[algogeeks] fastest sequential access

[shady]

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.......

--