K&B states that ArrayList is better suited for random access
and iteration when insert/delete is less likely to occur:
Choose this [ArrayList] over a LinkedList when you need fast iteration but aren�t as likely to be doing a
lot of insertion and deletion.
LinkedList is best at fast insert/delete operations. However, Thomas' article on performance at
The List Interface shows that a LinkedList is about 1.4 times faster doing plain iterations than an ArrayList. Why not choose LinkedList over ArrayList for all purposes but random access? And how to answer a potential exam question "what List implementation class is best for fast iteration"?