Amortized Dynamic Insertion and Deletion

The PushBack and PopBack operations are the typical insertion and deletion operations for dynamic Arrays. So I think the table should show their (amortized) complexity.

If you think the insertion and deletion algorithms should stay general consider changing the complexity for lists to O(n).