Code for Game Developers - Hash Tables @JorgeVinoRodriguez
Code for Game Developers - Hash Tables  @JorgeVinoRodriguez
Uploaded January 2015 | Updated November 2026, 2 hours ago
We implement a hash function that we use to assign indexes into a hash table. This lets us look up our data very quickly.

I forgot to mention in the video but if we let n be the number of items in the hash table and m be the length of the string we are hashing, the algorithmic complexity of a hash table is O(m). It does not depend on n at all, and since m is generally very small, people usually say that hash tables are O(1). That makes hash tables are your best friend.

More hash table algorithms can be found here: en.wikipedia.org/wiki/Hash_table

New video every Thursday. Question? Leave a comment below, or ask me on Twitter: twitter.com/VinoBS
Code for Game Developers - Hash TablesFinal Fantasy 7 Original Vs Remake Part 9: This Guy Are SickMath for Game Developers - Billboarding (Basis Vectors)Math for Game Developers - Floating Point NumbersMath for Game Developers - Model Creation PipelineMath for Game Developers - Smooth Move(ment) (Linear Interpolation)Final Fantasy 7 Original Vs Remake Part 4: He, Hey! Waitaminit you!!Debugger Programming 7: Showing valid breakpoint linesCode for Game Developers - Cache LevelsMath for Game Developers - Vertex BuffersSource Hammer - Optimizing PortalsMath for Game Developers - Common Integrals
Jorge Rodriguez |

Code for Game Developers - Hash Tables

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER