@ctietze This is primarily because insertions and removals have complexity that’s linear in the size of the array — they have to slide existing items to make room for a new one or to close gaps after a removal.
Arrays have benefits on small sizes because they are compact. Beyond a couple thousands or so items, this advantage is entirely eclipsed by all these movement costs: they become unbearably slow.
[1/2]
Add comment