Data Structures/Extensible Hashing
hashdynamicdirectory
Press play to start
1int ehash_search(EHash* t, int key) {
2 int idx = key & ((1 << t->global_depth) - 1);
3 Bucket* b = t->directory[idx];
4 for (int i = 0; i < b->n; i++)
5 if (b->keys[i] == key) return 1;
6 return 0;
7}
Step 1/0

Practice

LeetCode·#706 Design HashMapEasyLeetCode·#705 Design HashSetEasy
OperationBestAverageWorst
searchO(1)O(1)O(n)
insertO(1)O(1)O(n)
SpaceO(n)