Big-O Time Complexities for Elixir data structures 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
