Please enable JavaScript.
Coggle requires JavaScript to display documents.
Sets and Dictionaries, Space and time trade-offs, Hashing - Coggle Diagram
Sets and Dictionaries
Sets
-
Important methods
-
-
-
Also search, insertion and deletion
-
Dictionaries
ADT that implements search, insertion and deletion
-
-
Hashing
-
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.
Temporal Efficiency
-
If we manage to make it close to one, we have the price of one or two comparisons
Closed Hashing
-
Strategies
Linear Probing
Checks the cell of collision. If not empty, checks the cell's immediate successor and so forth until finding an empty cell to store.
-
-
-
-
-
