arrays are listed. What you probably mean is a linked list, which is another implementation of lists.
As for the performance characteristics of both days structures, modern cpus with lots of caching logic make those a lot more complicated. Naive arrays will almost always perform better than naive linked lists, even in random insertions, and a clever allocator can have a huge impact on list performance as it can mean the difference between list items being mostly consecutive memory regions or spread randomly all over the ram.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
arrays are listed. What you probably mean is a linked list, which is another implementation of lists.
As for the performance characteristics of both days structures, modern cpus with lots of caching logic make those a lot more complicated. Naive arrays will almost always perform better than naive linked lists, even in random insertions, and a clever allocator can have a huge impact on list performance as it can mean the difference between list items being mostly consecutive memory regions or spread randomly all over the ram.