List Access Times (ArrayList vs LinkedList)

dvas0004 / NerdNotes

A collection of notes: things I'd like to remember while reading technical articles, technical questions I couldn't answer, and so on.

12 stars 0 forks source link

Open dvas0004 opened 5 years ago

dvas0004 commented 5 years ago

ArrayList: faster at read/write operations on existing elements due to random access capability
LinkedList: faster at adding or removing elements since only 2 pointers need to be updated (remember double linked list)