Please enable JavaScript.
Coggle requires JavaScript to display documents.
Sets And Dictionaries - Coggle Diagram
Sets And Dictionaries
-
operations are:
finding the union of two sets, which comprises all the elements in either or both of them;
and finding the intersection of two sets, which comprises all the common elements in the sets
-
-
Dictionaries
Hashing
Based on the ideia of distibuting the elements trough a one-dimensional array that world be called hash table
*
A hash table’s size should not be excessively large compared to the number of keys, but it should be sufficient to not jeopardize the implementation’s time efficiency
A hash function needs to distribute keys among the cells of the hash table as evenly as possible. (This requirement makes it desirable, for most applications,
to have a hash function dependent on all bits of a key, not just some of them.)
-
Strategies
Open Hashing
In open hashing, keys are stored in linked lists attached to cells of a hash table. Each list contains all the keys hashed to its cell. Consider, as an example, the following list of words:
Closed Hashing
In open hashing, keys are stored in linked lists attached to cells of a hash table. Each list contains all the keys hashed to its cell.