What is the time complexity of removing an element from a dynamic array?

The time complexity of removing an element from a dynamic array depends on the position of the element being removed:

• If the last element is removed, the operation is O(1), as the size of the array is simply decreased.
• If an element in the middle or beginning is removed, all subsequent elements need to be shifted to the left, which takes O(n) time, where n is the number of elements after the removed element.

Thus, in the worst case, removing from a dynamic array is O(n).