I have question: how can Array insert and delete at tail take O(n) time?
Insertion in the worst case could be that the whole array is filled up and resizing will take O(N) time.
But deletion should O(1) I think.
1 Like