Wikipedia does not list insertion complexity for arrays in the list of linked-list implementations.
Is this because insertion operations are not defined on the array ADT?
The array is a fixed-size data structure, and insertions would change its size. Thus they are impossible, which is why Wikipedia says "N/A" for the insertion complexity.
A dynamic array can have its size changed, which is why complexities are given in that column.