filmov
tv
Hash Table Double Hashing Bucket and Probing and Retrieve DSA
![preview_player](https://i.ytimg.com/vi/bNXrLRbG_SE/maxresdefault.jpg)
Показать описание
What if you can search a text without sorting first quickly? Yes you can with hash table!! Check out this algorithm. Full explanation of hash table basic introduction. DSA - Data Structure and Algorithm. Click Show More for title. 20:28 edit: you don't need to count it just use a do-while loop until it reach the starting index
0:00 introduction
1:00 how hash table work
2:10 how to make Hash1 result unique
3:34 prime number is the key
5:36 collision situation
6:01 Probing - linear probing
7:00 Problem of linear probing
8:26 Cluster
8:48 Alternative to Open Addressing aka COLLISION HANDLING
9:21 stepHash aka Hash2 - hashing second time
12:26 stepHash result Minimum and Maximum range
20:28 possibility of maximum "i" range
20:44 retrieve String that had been probed before
0:00 introduction
1:00 how hash table work
2:10 how to make Hash1 result unique
3:34 prime number is the key
5:36 collision situation
6:01 Probing - linear probing
7:00 Problem of linear probing
8:26 Cluster
8:48 Alternative to Open Addressing aka COLLISION HANDLING
9:21 stepHash aka Hash2 - hashing second time
12:26 stepHash result Minimum and Maximum range
20:28 possibility of maximum "i" range
20:44 retrieve String that had been probed before