What is a HashTable Data Structure – Introduction to Hash Tables , Part 0

35
3



This tutorial is an introduction to hash tables. A hash table is a data structure that is used to implement an associative array. This video explains some of the basic concepts regarding hash tables, and also discusses one method (chaining) that can be used to avoid collisions.

Wan’t to learn C++? I highly recommend this book

Donate

STILL NEED MORE HELP?
Connect one-on-one with a Programming Tutor. Click the link below:

🙂

Nguồn:https://wijstaanvooronzegrondrechten.org/

Xem Thêm Bài Viết Khác:https://wijstaanvooronzegrondrechten.org/cong-nghe

35 COMMENTS

  1. Triangle, Polygon, Parallelogram, Octagon, Heptagon, Hexagon, Trapezoid no…. wait for it…. squiggly lines. Also it would be of great value to explain how to write a hash function and best practices for collision avoidance. Good work.

  2. Honestly, I never understood hash tables during my 2nd year in college but now you made it simple and more understandable to me,Thanks.

  3. But a hash function doesn't spit out an index, it spits out a hash value, you didn't address the reason as to why the function even uses hash values if the index is all that is (apparently) needed to explain the hash table
    Edit: a distinction should be made between hashing and indexing, is what I'm trying to say

  4. this is the best video on the topic even if he did forget the triangle. very clear.
    improvements for version 2? you could use real names rather than 'person' and 'that person' and perhaps show a box with 'Paul' and '555 1943' in it.
    but otherwise it is perfect. i don't quite understand why other videos and books make such a meal of it.

  5. I've been searching for explanations on Hash for about an hour and it's thanks to you that I finally got the concept. Thank you!

LEAVE A REPLY

Please enter your comment!
Please enter your name here