Map [1]
| Operation | Time Complexity |
|---|---|
| Access | O(log n) |
| Search | O(log n) |
| Insertion | O(n) for < 32 elements, O(log n) for >= 32 elements [2] |
| Deletion | O(n) for < 32 elements, O(log n) for >= 32 elements |
Kvnyu
/ big-o.md
Created
May 17, 2022 07:09
— forked from PJUllrich/big-o.md
Big-O Time Complexities for Elixir Data Structures