Open Addressing (Hashing: Fundamentals and Algorithms)
1In today's lesson, we see how to resolve collisions while using the table space directly. At the heart of this is the concept of a probing sequence, that create hops!
Time Stamps:
0:00 Opening, idea
8:06 How does one apply a probing sequence?
10:44 Linear probing
17:26 Examples
23:25 How can we delete entries/records without needing to rehash the whole table?
27:41 Summary
32:55 Double Hashing
42:46 Example
50:03 In double hashing, why must the table size be a prime number?
57:24 Closing
Have a beautiful day!
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Patreon Supporters (Supporter Access!):
Eric R
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard
Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-R-Page
TWITCH: https://www.twitch.tv/pagewizard
#ComputerScience
#hashing
#DataStructures