•Keys and elements are stored as
pairs, ordered by key.
•For an ordered map, the “<“
relation for keys determines the (sorted) order.
•For a hashed map, the bucket
(and hence the order) is determined by the hash value of the key. If the hash function is performing well, keys
should be scattered throughout the hash table, equally distributed
among the buckets.