3.3 Dictionary

Time Complexity

  • >Dictionaries are implemented using HashMaps, so most operations are O(1) and worst case O(n).
  • >get, set and delete are O(1).
  • >Iteration is O(n).