Time complexity: Algorithm running time. The greater the number of operations performed, the higher the complexity.
However, once the array is not full, add is only going to have to copy one value in to the array, so in that case its time is in addition to the amount of the list; i.e., constant time. In practice, we want the tiniest F — the least upper bound on the actual complexity….