java - Why is ArrayDeque better than LinkedList - Stack Overflow
Linked structures are possibly the worst structure to iterate with a cache miss on each element. On top of it they consume way more memory.
If you need add/remove of the both ends, ArrayDeque is significantly better than a linked list. Random access each element is also O(1) for a cyclic queue.
The only better operation of a linked list is removing the current element during iteration.
Read full article from java - Why is ArrayDeque better than LinkedList - Stack Overflow
No comments:
Post a Comment