1.Previous
3.Next

with each dictionary operation taking constant time. However, the space requirement for this structure is the size of the entire keyspace, making it impractical unless the keyspace is small.

The two major approaches for implementing dictionaries are a hash table or a search tree.

Hash table implementations

The most common general-purpose implementation of an associative array is a hash table: an array

1.Previous
3.Next