Array List will be always faster than Linked list in terms of read. ArrayList is basically array implementation and the memory allocated for an array is sequentially so read is faster. But when you using list which requires insertion or delete in between the list then Linked List is faster . Because it just had to add the links in between nodes. In these two cases array list will be slower.Usage can be :
ArrayList - Faster read operation, insertion,deletion between the list is slower.
Linked List - Read operation slow compared to Array List but insertion,deletion between the list is faster.
