Linked list vs. dynamic array for implementing a stack

Question

I\'ve started reviewing data structures and algorithms before my final year of school starts to make sure I\'m on top of everything. One review problem said \"Implement a s

Answer 1

Resizing the dynamic array would not be an expensive task if you design your implementation well.

For instance, to grow the array, if it is full, create a new array of twice the size, and copy items.

You will end up with an amortized cost of ~3N for adding N items.