dont know why you stopped making these tutorials it's the best one i've ever seen and love the extra effort you give to explain it with animations/drawings i hope you continue these series because its very very very very very very fantastic thank you for your content
Great video. What do you use to make those animations? I teach manufacturing engineering at university, and would love to use something like this instead of clunky PowerPoint animations.
Great video! Thanks for creating this!! I'm just confused about one thing....doesn't a hash map hold key:value pairs? Meaning, each key should have an associated value? This seems more like a "set" data structure, but allows non-distinct entries..? Am I missing something?
The set-like nature of hash tables comes into play in order to handle collisions. If her hash map was larger than 7, there would be less collisions and most of the buckets would only contain 1 entry which is ideal to retain constant time for search/insert/delete operations. The other thing that can be changed to reduce collision probability is the hashing algorithm but the size of the hash table is more significant.
@@a6b59ghj51d right but that still doesn't change the fact that this implementation doesn't hold key value pairs, like a hashmap or hashset is supposed to.
Hash tables are not required to implement key/value pairs but hashmaps which do this are a common application of Hash Tables. With that being said, technically this is storing key/value pairs in the sense that the value matches the key and the code can be trivially modified to store a value passed as an additional argument to the insert parameter.
dont know why you stopped making these tutorials
it's the best one i've ever seen and love the extra effort you give to explain it with animations/drawings
i hope you continue these series because its very very very very very very fantastic
thank you for your content
Keep going Jamie!! You are doing a great job
I'm glad I found this channel!! So far the best explanations for me!
i will forever visualize South Park characters when i think of hash tables, and i'm so happy about that lol
지식이 늘었따...
Great video. What do you use to make those animations? I teach manufacturing engineering at university, and would love to use something like this instead of clunky PowerPoint animations.
+1 for southpark reference
Very professional explanation , keep going !
You're amazing!!!!
Great video! Thanks for creating this!! I'm just confused about one thing....doesn't a hash map hold key:value pairs? Meaning, each key should have an associated value? This seems more like a "set" data structure, but allows non-distinct entries..?
Am I missing something?
The set-like nature of hash tables comes into play in order to handle collisions. If her hash map was larger than 7, there would be less collisions and most of the buckets would only contain 1 entry which is ideal to retain constant time for search/insert/delete operations. The other thing that can be changed to reduce collision probability is the hashing algorithm but the size of the hash table is more significant.
@@a6b59ghj51d right but that still doesn't change the fact that this implementation doesn't hold key value pairs, like a hashmap or hashset is supposed to.
Hash tables are not required to implement key/value pairs but hashmaps which do this are a common application of Hash Tables. With that being said, technically this is storing key/value pairs in the sense that the value matches the key and the code can be trivially modified to store a value passed as an additional argument to the insert parameter.
Just add a `val` field to the BucketNode struct if you need it, it doesn't change much :P
What happend to your old channel??