在Java中使用基于Vector的Stack实现而不是链表的动机是什么？

Question

What was the motivation of using a Vector based implementation of a Stack in Java instead over a linked list implementation? I realize a Vector is synchronized and that has inherit advantages (and overhead), but I feel like not only are these data structures typically taught in texts as linked list based structures but LLs avoid costly resizes as the underlying array fills.

I do understand that Vectors , using amortized analysis, are O(1) even with the resizes. So maybe taking this into consideration it doesn't make much of a difference, but I would be curious to understand the rationale none the less.

Answer 1

Linked-lists have the following disadvantages:

• Per-element storage overhead
• Computational complexity from having to follow pointers/references from element to element
• Bad cache locality

Of course, these are just generic disadvantages of linked-lists; I have no idea whether they affected the decision for what to base Queue and Stack on.

Answer 2

A vector stores its data in contiguous memory. This is good for caching.

A linked list can become very fragmented in memory.