Originally posted by Campbell Ritchie:
Bit of an exaggeration to say ArrayList is very slow in insertion and deletion. Slower than a LinkedList, yes, but not very slow.
Yup. You are right. When we add or delete elements to it, then we don't even realize it.
But there is a reason why I said it. ArrayList is slower than LinkedList but HashMap is faster than LinkedHashMap in insertion and deletion. So in the beginning I used to get confused between these as one of the Linked collection is fast and one is slow. So I memorized it by thinking that ArrayList is very slow, Linked collections are fast but HashMap is ultra fast. So the statement came out of mind out of intuition
...