What is the asymptotic complexity of operations with the vector container in C++?

Access time by index: O(1) Insertion at the end (when there is free capacity): O(1) Insertion at the end (when resizing): O(N) Insertion at the beginning: O(N) Insertion in the middle: O(N) Deletion from the end: O(1) Deletion from the beginning: O(N) Deletion from the middle: O(N)