CareerCup

vectors are normally implemented in ONE bulk linear, which makes it slow to
add items if you increase above the buffer of them.
lists are normally implemented using linked lists, which makes an insertion
fast, but a retrieval slow.
If you know the size (approximately) use vector and set the buffer to that
size, if you don't know size use list...

... and, you can't access the contents of a linked list randomly, which you can with a vector. Certain algorithms are more efficient with vectors than with lists.

Retrieval	Insertion	Prepending	Appending       Deletion
LinkedList<T>	O(n)		   O(1)	          O(1)		   O(1)          O(n)
Vector<T>	O(1)		   O(n)		  O(n)		Amort. O(1)      O(1)

@^ Deletion is not constant for Vector