The efficency of adding to the middle of a list implemented with an array is

O(n)
  • O(1)
  • O(n^2)
  • O(logn)

Items will need to be shifted to make room for the new item.