An introduction to the hash table data structures, how that relates to associative arrays and dictionaries, and how to use them.

Support me on:
Patreon:   / simondevyt  

Follow me on:
Twitter:   / iced_coffee_dev  
Instagram:   / beer_and_code  
Github: https://github.com/simondevyoutube/

Covering a bit more ground with data structures, algorithms, and optimizations, we're looking at hash tables now. These are amazing, general purpose data structures that are a good fit in a lot of cases. We'll explore the different collision resolution schemes like chaining and open addressing. We'll touch on abstract data structures and the difference between an associative array (or dictionary) and a hash table. Finally, we'll do a dive through existing code to show some examples of where I've used them in a lot of the games I've built in JavaScript.

Misc Links:
http://scottmeyers.blogspot.com/2015/...
https://en.wikipedia.org/wiki/Hash_table
https://en.wikipedia.org/wiki/Associa...
https://en.wikipedia.org/wiki/Abstrac...
https://en.wikipedia.org/wiki/Birthda...
https://en.wikipedia.org/wiki/Open_ad...
https://en.wikipedia.org/wiki/Linear_...
https://en.wikipedia.org/wiki/Quadrat...
https://en.wikipedia.org/wiki/Double_...
https://en.wikipedia.org/wiki/Compari...)