Array Properties and Time Complexities

What is an Array's strength?

O(1) random access by index.

Is an Array fixed or dynamic?

Fixed size in traditional arrays; dynamic arrays can resize.

Array Access

O(1)

Array Search

O(n) - Must scan through elements unless already sorted.

Array Insert

Beginning/Middle: O(n) because elements must be shifted.

End: O(1) if space available

Array Delete

End: O(1); Beginning/Middle: O(n) because elements must be shifted.

Does an Array preserve order?

Yes. Elements remain in insertion/index order.

Array Weaknesses

Slow insertions and deletions in the middle; traditional arrays have fixed size.

Common Array Use Cases

Indexing, iteration, matrices, lookup tables.

Does an Array preserve order?

Yes. Elements remain in their index/insertion order.

Does an Array allow duplicates?

Yes.