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
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










