Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the features and strengths/weaknesses of dynamic arrays (vectors), including initialization, size retrieval, and O(1) element access. It also discusses efficient manipulation techniques like push_back, pop_back, insert, and erase, highlighting the trade-offs involved. Additionally, it explores strategies to reduce the complexity of adding and removing elements in an unsorted dynamic array.