nathanzilgo/programacao_concorrente

programacao_concorrent

Linked List Operations

1. Access element: single=O(n), double=O(n)
2. Add/remove at iterator position: single=O(1), double=O(1)
3. Add/remove first elements: single=O(1), double=O(1)
4. Add last element: single=O(1), double=O(1)
5. Remove last element: single=O(n), double=O(1)

Hash Map Operations