One can move across all these scaling factors by changing from linear access to random access. A common example is linked lists vs arraylists. Many articles show it takes about 5 inserts per read for a linked list to beat arraylists.
Not with large data sizes it doesn't. Which is the whole point. Array would be even slower than the list on insert because you actually have to move much more data around.
The one thing array is better at its sometimes locality, especially if you iterate over neighbouring elements.
