What is a HashTable Data Structure - Introduction to Hash Tables , Part 0
ฝัง
- เผยแพร่เมื่อ 21 ก.ย. 2024
- 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 amzn.to/1PftaSt
Donate bit.ly/17vCDFx
STILL NEED MORE HELP?
Connect one-on-one with a Programming Tutor. Click the link below:
trk.justanswer...
:)
![[TH] JFT vs RLF - VCT Ascension Pacific - Day 2](http://i.ytimg.com/vi/PuIH7w_jO6c/mqdefault.jpg)
![วันเกิดเธอ (TO YOU) - PHUWIN [ OFFICIAL MV ]](http://i.ytimg.com/vi/_ROx1Bj3T0Y/mqdefault.jpg)
Many hash table videos explained it as if the listener already knew the basics, which is the worst way to teach. This video does not skip basics and gets down to the exact details that the beginners need to know to go further. Thank you very much!
I never knew I had such feelings for triangle.
Triangles are my favourite shape.
haha!
LOL
LMAO
hahahahahahahaha
I cannot begin to explain how deeply disturbed and annoyed I am that he never once considered the shape triangle... like what the- I don't even...
xXGrandclosingXx Haha! I don't know what I was thinking. I mean squiggly line and sideways squiggly line are really dear to me and I didn't want to leave them out. But triangle, no wonder I haven't heard from triangle all this time. I would call triangle to try and work things out, but I can't because I forgot to put triangle's contact info into my hash table. Oh I feel so bad now. :)
Paul Programming I like using upside-down triangles when drawing out stuff too.
+xXGrandclosingXx Illuminati not confirmed.
+xXGrandclosingXx LOL I thought the same thing! :D
+xXGrandclosingXx Bruh....same here LOOOL
You went with "squiggly line" over triangle?! Dude...
hahahahahahahahaha
classic programmer title "Part 0" ;)
+Frank Bush i thought arrays start at -1
+Frank Bush Or contemporary programmer. During the 1970s and up to the late 1980s, arrays typically started at index 1. We used languages like Algol, Pascal, Modula2, Ada, etc., many of which allowed you to choose an arbitrary range (such as _monday..friday_). It was typically only assembly programmers that used index 0 (i.e. until the C-like languages took over the whole industry).
+Frank Bush real programmers start counting from 0 ;)
+TheTanDoctor I have been a programmer for 20 years. Was just tryin' to be funny then it turned all academic...sigh
I like Frank and his humor
I went through a 44 slide lecture on this topic for my class. I only understood like 20% of it. Then I found this video. It all slowly clicked. Thank you so much for this.
Seriously thank you man. Our teacher in data structures and algo is slacking off.. He hasn't taught us anything the whole semester aside preliminations.. And he just assigns us to report the lessons in class.. basically we're just the ones teaching ourselves (and then the worse part is we're paying him).. But you sir, have my respect.. Liked!
Thx a lot, just got my first job as developer and this vid helped me much more then wikipedia articles. More over english is not my native english, but your speech takes 100% clear and understandable.
Instead of link lists, we can have root of a tree in the hashtable. If the number of elements become very large, then for searching in link lists, it will be O(n) whereas for binary search trees, we can search for a particular value from its hash index in O(log(n)).
I was laughing so hard when i read all those pro triangle people comments :D
I recently took a PluralSight course on Hashing, and I needed some extra high level perspective. When I saw this video, it really helped me to get the big picture a lot better. Thanks for teaching!
same here, trying to understand it from "The art of computer programming vol.3 " and it's so difficult to understand it there
what do you have against triangles
I think you guys are the best subscribers on all of TH-cam! I love reading all of your comments! Thanks for all the positive feedback!
in your case its different because you worth
Came in the comment section so I can see someone further explaining the matter but all I see is people crying over a "Triangle" like that shape is their Daddy
stfu
@@maharta8458 stfu
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!
I really learned a lot from these tutorials on Hash Tables. Thank You. Great Job.
I appreciate you first explaining the concept on paper before jumping into code like a lot of youtubers tend to do
"I hope that that was helpful to you guys"
Yes, yes it was :) thanks for the video!
Thanks for the illustration. It made things more easy to understand.
Thanks Paul! Decided to go back to basics with distributed systems, so that I can fully understand them, and this was a perfect place to start :)
to be honest, paul's video about hash table is the best I have meet
Best tutorial on youtube :) But remember u guys the best learning is the best practising
1 hour of class in 7 minutes. Thanks.
This is the best intro video about hashtables I came across so far
Whole day I have spent to understand the concept of hashing, but this video gives me precise and crisp idea. Now I can go further and read any example to understand Hashing. Thanks again and please send me more information and video on hashing if you have. Highly appreciated your effort!!!
It has been more than 7 yrs now, still no triangle. RIP Triangle. :(
😂😂😂
Thanks for putting the time and energy into publishing and sharing your knowledge! Much appreciated!
Excellent explanation. Thanks Paul!!
Paul We need more and more of data structures. I can not wait to see more. Thank you very much!
Very helpful. Explanations are clear. Thank you so much. Great service to humanity indeed. Such services make average/beginners embrace programming with interest.
Very clear explanation. And some updates about Java8, it uses a tree structure for each bucket instead of a linked list to enhance search performance.
Very Good Sir..... you are Guru of HahsFunction ....
Great video. The best part is that the concept is explained so beautifully and easily that even a kindergarten kid can understand it.
This is absolutely one of the best explaining video of hash table by far, thank you so much!!!!!
Sometimes us novice undergrads need the simple explanation. Thanks!
Best description and application explanation for hashing I have seen!! Thanks
I was waiting for Paul to draw a triangle hahaha
he forgot one of the most basic shapes! triangle!
i was waiting for him to use a triangle, but he never did. kinda disappointed, but will go cry about it offline.
Omgggggg thank u sooooooooooooo much for this explanation! I'm a beginner and this really helped me to understand. Greatly appreciated!!!
your explanation is much better than at the university. thank you very much!
You made the complex thing look easier. Thank you.
Diagrammatic explanation is very much use full.. Keep posting such videos in future..
Very clear and concise explanation. You're a great teacher!
best explanation on internet
This is really good, I've watched multiple videos and it finally clicked after watching this video
Awesome video, congratulations about it. I have never whatched such a simple and undestandable explanation of the hash tables and collisions.
Awesome, I understood Hash tables from your video.
Outstanding intro to hash tables, both extremely informative and accessible!
No triangle? Illuminati unconfirmed.
Triangle isn't a real shape. It's actually 3 very narrow rectangles in disguise....
X-file theme song in the background.
lmao
Great explanation. My data structures text book made no since to me and the other videos I found online either went into too much detail or not enough detail. Thanks a lot Paul.
Easy, clear and excellent video.
You made my 3 hours data structures lecture much simpler.
thank you, very good video and simplified instruction, even cavemen could learn this.
When you said squiggly line, I immediately thought, "You mean The Artist Formerly Known as Prince". Anyways, good video!
Thanks a lot man! I'm not kidding, it makes me expert with Hashing ! Now, I can do my school project. (Y)
How was your school project?
@@camtasia1000 I graduated as an honor student 👨🎓😁💯
Great video. It`s so easy to understand with your explanations!Great job! It would be nice to see more videos about advanced data structures and algorithms.
Here from a link in Udacity ALX Full Stack course
Very well described, I completely understood it the first time through. Thank you!
thank you sir i had understood the hash table structure i continue watching your tutorials really thank you very much sir
That was very helpful. I am a visual person so that was a perfect explanation. Thanks!
Simple and comprehensive explanation. It was helpful, thank you!
Very Precise. Very simple. Easily understood. Good graphics. Subscribed.
U the only one who made hash tables easy to learn 😍 thnxs alot ur a great👍🏻
excellent explanation, simple and short.
One of the Best Programming videos I have watched Thaks
Paul, thanks for the very clear tutorial. I understood the lesson perfectly!
i thought wow 940,000 views gotta view this and Mr Paul did not disappoint
Prajjwal Singh Wow, I didn’t even realize it had that many views until you mentioned it! Happy to hear so many people are enjoying it!
Thanks a lot Paul. You can make hard things a lot more easier to understand.
Concise, as it should be, Thank you!
Thank you for the clear explanation Paul
finally a video with no indian accent !!!! in tears...
I really enjoyed learning this thank you Paul
Shape: Triangle.
Thank you though.
Great video :) Thanks.
Question though, how do you know which value corresponds to that particular key if there are two other values taking up index 1?
Jas Shih Each key value pair will have it's own node inside of index 1. For example if you are searching for the key "Jas Shih" then you will insert the key into the hash function like this.... hash("Jash Shih"); Then the hash function will direct you to the correct index. Once you get the index from the hash function, you can search the linked list of nodes in that index for the key "Jas Shih". Once you have found the node in that list containing the key, you can look at it's value.
Thank you :)))
@@PaulProgramming Won't it take O(n) to search the entire chained Linked List? I mean, ok, we get the index O(1) time, but we end up getting O(n) due to searching linked list. Isn't that so?
@@hackzyoboy2459 yes, so what's your point here? You have other solutions? Like if you don't you linked lists then what'll be used?
Appreciate the simple explanation. Thank you kind sir :)
Thanks! Very clear and non-redundant tutorial!
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.
RIP Triangle (Beginning of time - 2013)
This was extremely helpful Paul! You are doing brilliantly and you speak very clearly!
Excellent - simple and extremely clear. Many thanks!
Its straight forward and simple
Everyone should click this video 1st before digging into other complicated intros.
Nice Video Paul .. Explained in very easy terms .
Don't stop making videos please.
Brief explanation, good job. Thanks!
Excellent video again. Really well explained. Keep them coming 👍
Thanks for helping me understand hash tables!
how can we retrieve the phone numbers if two persons have the same index value?...i mean there can be many ph. no.s at same index by chaining ...how do we know which phone number belong to whom?
Hash tables are often used to convert RAM (random access memory) into content addressable memory (CAM, not to be confused with computer-aided design). This can be done in hardware at a high cost in chip complexity, but hash tables are the software version. Software is, of course, much slower.
Hardware implementations are used in the translation lookaside buffers of memory cache systems because of the need for speed.
pual i have a quasteion : is hash tables share same index in the memory or something like that cus you have said that if we have multiple value in save index they will link to the same index with different key , i just wanna know that i leared that right
Well done and thank you. I wanted to understand hashing better, and this video helped.
Hi Paul, thank you ..the video was simple and helpful
Easy to understand. Thank you
That was too good man.Well explained!
Thank you for an understandable overview of the topic.
you make the best videos,very easy to understand. thanks for your good work.
the best explanation! Thank you so much!
Paul = the plug! Thanks a lot!!
Hey! Thanks, Paul. I really appreciate you taking the time to make this video. It was super helpful. I love you! :*
Very nice explanation of hash tables, found it useful. Thank you