Please enable JavaScript.
Coggle requires JavaScript to display documents.
Set and Dictionaries - Coggle Diagram
Set and Dictionaries
Space and time trade-offs
Prestructuring
Hashing
Hashing Function
Hash Adress
Key
Hash table
Versions
Opened Hashing
Keys are stored in linked lists attached to cells
Colision
Add in Cell's linked list
S ≃ 1 + α/2
Closed Hashing
Keys are stored in the hash table
Colision
Add in next empty hash table's cell
Cluster
Double hashing soution
S ≃ 1/2( 1 + 1/(1 − α)) a
Indexing with B-trees
Dynamic programming
Input enhancement
Couting methods by sorting
Boyer-Moore Algorithm
Types
Universal
Bit vector