Data Structures: Hash Table implementation in C

Hash Tables are one of the most widely used data structures in computing. Knowing how they work and why they are efficient is important even if you never directly interact with them. Some languages have them built in and others you must do it yourself. In this video, we're doing it ourselves.

Hope you enjoyed the video!

Check out this code here:

Join my Discord server to chat with me:

Check out some code on my GitHub:

Come visit us on Reddit:

Other Social:

[wolvAUS]

Holy shit. This is just what I was looking for. Finally no need to decipher tutorials filmed in 240p.

[rohitnarwal]

please upload more videos on data structure including linked list, trees, heap, etc.
btw love this .... helps me a lot❤

[volutionmedia]

I think I would have been useful to tell people that this is the separate chaining method, might have also been interesting to see you implement open addressing. :)

[brightly]

Thanks for doing a great job. It did help to get started with other needed stuff. Before my project I was worrying that C does not include any hash library, but here it is
Thanks one more time. :)

[docxy]

The video i was waiting for. You are the best EM!!

[mechjack]

Good to see you posting agian. Like way you brake things down.

[ZacKoch]

I don't understand C, but that was very clear visually! Nice 🤘

[juripunnar]

great video, explained it better than professors at university!

[chawza]

this so goood. i studied this on my second semester and it was awful. this is much easier and faster than i taught in my univ (not as advance as this but more complicated to read). now i have a better view of hash table to make on the future thanks to this.

[twansrude]

Thank you for the quality content as always.

[saikiran-cool]

I like your coding style. It helps me a lot, Thanks mate.

[kphuang]

Thanks for the tutorial! This is so clear that I have to practice this immediately. I prefer the returns out of loops, I'll try to modify the code into that version.

[emanuele]

7:15 These 3 lines are completely useless. Did you add them just to add the comment?
Thanks for the video, it was very instructive.

[bbthing]

Dr. Dobb’s Journal once had a beautiful string hash called a length-dependent hash. The hashing function added the first and last bytes of the string and the length of the string to obtain the hash value. This always resulted in a very low number of collisions. I also wrote an analysis program to show the number of collisions to verify this for every set of string identifiers or string keys in every new application. It always worked beautifully and very quickly.

[soyitiel]

I'm pretty sure you can get rid of that *_if (entry == NULL) return NULL;_* in *_ht_get()_* at 7:04 since the loop won't run anyway when *_entry == NULL_* and still *_return NULL;_* at the end

[richardtwyning]

Good to have you back Engineer Man. Sorry to hear what happened. Terrible. Look forward to seeing your security measures.

[acatisfinetoo]

I like your style of teaching this subject. please do a vid on binary heaps, circular queues 😉

[dorb]

Thank you, that's amazing content :)

[menycv]

Why in the hash function you multiply by 37? Does this number have a meaning or is it just random?

[unsteadyplan]

Thank you for useful video Engineer Man. I have a one question, what does the <limits.h> do in this code, I read that <limits.h> library offer the maximun and minimum size of integral values. I couldn't find any terms of <limits.h> and if I don't include it, then the code doesn't work properly.