Finally. I searched the whole web and finally found an explanation to this I absolutely understand. Well done! Thank you.
@BROOK_TAMILAN
2 ай бұрын
😂me too
@THALL666
8 жыл бұрын
Thank you for posting this! You made it simple to understand.
@theblazestorm
8 жыл бұрын
simplest explanation i found! Thanks so much dude! :D
@johnslick8940
4 ай бұрын
Thank you very much for this video Michael !
@GtaRockt
7 жыл бұрын
Thanks Mr. Michael
@Mr30friends
7 жыл бұрын
Sometimes I dont get it. Everyone and their grandma has a decent mic nowadays. How come people that do all the effort to prepare such a good course are the ones that ALWAYS have the shittiest mic. Thanks anyways.
@user-vj2wv8qx2e
8 жыл бұрын
This is incredibly good! You make me love doing hashing
@henrypalma6400
2 жыл бұрын
You are amazing, thank you so much :)
@mohammadbagheri8182
5 ай бұрын
It was awesome thanks man
@adelrose1492
5 жыл бұрын
your video helped, thank you very much.
@TheFotoGuys
2 жыл бұрын
Thanks great examples and explanations :D The only video I have found that uses simple and easy to understand examples and explanations.
@kevinchau5336
6 жыл бұрын
Awesome video dude! I should have watched this for the exam instead of waiting until the final!
@mikedelta658
Жыл бұрын
Thank you!
@NonickGG
9 жыл бұрын
do you know another way to calculate those numbers ?
@vmorita
5 жыл бұрын
Thank you
@DasLischtlein
21 күн бұрын
thanks mate
@abhimanchaudhary8988
8 жыл бұрын
Thank you sir :)
@steveyks8997
5 жыл бұрын
How do you know the table size if it's not given like the 3rd exampale, that's the only part i do not understand.
@joelcruz2873
5 жыл бұрын
the size of the hash table has to always be either predetermined, or set by the user. There's no set function used in order to derive a size given an amount of keys
@Miic81
5 жыл бұрын
It has to be between 0 and that number -1 Like mod 6 would be 0 to 5 Mod 4 ...0 to 3
@parkersornberger260
3 жыл бұрын
So what if you try to hash 6 values to a table of size 5? Every video about linear probing seems to gloss over this scenario
@michaelmroczka
3 жыл бұрын
Hey Parker, it's glossed over since no one uses linear probing in real life (it's a bad algorithm since there are many collisions). If you need to put x items into buckets but you only have x-1 buckets you're guaranteed to have a collision. The whole point of a good hashing function is to make looking up things quickly which means avoiding collisions. If this is for a test or homework problem where you're asked to do this then you'll need to ask your teacher how they want you to handle this scenario. It's not covered because doing this in the real world is stupid. To answer your question, two approaches make sense. If you need to put more items in the hash than there are buckets you'll need to do one of two things. Either 1) store more than one element in a single bucket (via a method like Open Chaining, perhaps kzitem.info/news/bejne/pqufso2QpHNllWk) OR 2) rehash. Which is a fancy way of saying increase the number of buckets you have to store things in (kzitem.info/news/bejne/z4mi1Wl4soGndaA). Hope this helps. Good luck studying.
@parkersornberger260
3 жыл бұрын
@@michaelmroczka this absolutely helps! Thank you so much!
@sanchitpudasai680
9 ай бұрын
What if there were 6elements to insery
@julialaikhtman7897
9 жыл бұрын
thanks!
@gluetubeserver
8 жыл бұрын
+Julia Ozerov are you in comp sci too?
@arsalanumar6313
7 жыл бұрын
Superb.. u Made my day.. i m making Ur dollar by liking Nd comment.. :p
@SujalManandhar
7 жыл бұрын
Explaining is good but the sound quality is just horrible.
@davejoseph5615
6 жыл бұрын
But why would you want to do this? Your values end up being scattered all over.
Пікірлер: 33