This is the most instructive, satisfying, relaxing programming videos on UA-cam. The black background coupled with thr neon pens and even the professor cloths and voice makes this unparalleled to anything else. Best of all is how knowledgeable and comprehensive he is, he doesnt cut coners and does the gritty work, allowing us to process the godlike information while giving his side explanations. I have seen these videos i a more stressful time. I never understood how enjoyable these are when you just watch them for fun. I mean, i planned to watch the first hash video, and here i am binge watching the whole playlist, at 3 am in the morning, with a smile on my face. Thank you once again professor! You're the greatest programing teacher!
The hash function never change. What change is the the value of modular function applied to the result of that hash function. Probably the new place will be in a different position. ie hashFn(el) = 34, if the array is size 10 then the position will be 4 (34%10), but if you duplicate the size then the position will be 14 (34%20).
i understood rehashing but i wanna know how does the glass board work? is he writing inverted(that couldn't be right?) or is this some editing magic or any concept of physics i dont know???? please if someone knows tell me!!
When he talks about hashes based on opening addressing he says that we can double array and just copy all items from previous array. But, will it work properly when we try get value from hash table? Taking into consideration the new size of table, don’t we have to recalculate the hash codes again?( like we did with chaining approach)
you need to watch video number 30(Hashes make an integer positive) of this playlist. It's really interesting. My brain used hashing to find that videos location. I have some keyvalues such as positive, integer. The position was somewhere in last 15 videos of the current size. I looked for the keys and found Hashes make an integer positive. Than I gave you the entire video content, the huge value.
This is the most instructive, satisfying, relaxing programming videos on UA-cam. The black background coupled with thr neon pens and even the professor cloths and voice makes this unparalleled to anything else. Best of all is how knowledgeable and comprehensive he is, he doesnt cut coners and does the gritty work, allowing us to process the godlike information while giving his side explanations.
I have seen these videos i a more stressful time. I never understood how enjoyable these are when you just watch them for fun. I mean, i planned to watch the first hash video, and here i am binge watching the whole playlist, at 3 am in the morning, with a smile on my face.
Thank you once again professor! You're the greatest programing teacher!
Thanks this really helped me in my algorithm and data structure class. It is the more complete and clear tutorial that i have seen.
So basically Rehashing means reinserting everything with the new hash function ?
yes
The hash function never change. What change is the the value of modular function applied to the result of that hash function. Probably the new place will be in a different position.
ie hashFn(el) = 34, if the array is size 10 then the position will be 4 (34%10), but if you duplicate the size then the position will be 14 (34%20).
Thanks for your effort. and cleaning board multiple time to make us understand. big thanks from india
i understood rehashing but i wanna know how does the glass board work? is he writing inverted(that couldn't be right?) or is this some editing magic or any concept of physics i dont know???? please if someone knows tell me!!
When he talks about hashes based on opening addressing he says that we can double array and just copy all items from previous array. But, will it work properly when we try get value from hash table? Taking into consideration the new size of table, don’t we have to recalculate the hash codes again?( like we did with chaining approach)
yes we do have to recalculate hash codes again taking the new size of array .
The hashes are based on the mod of the tablesize. If you change the size the old hashes wont be found if you try to reach them with the updated key.
Nice explanation .. the way you are writing on the board is more interesting ...:)
awesome explanation sir... thanks a lot
what if i kept my history of sizes and checked it to search an item
03:36 He got a stand 🌝 Jojo Fans Assemble
Nice explanation sir
why dont we just return the positive number
Thank you
using the selfie camera to record video in front of glass frame
How is the hashcode value hv made positive? What did he actually write? Can somebody help me?
He made it positive with the next code "hashCode & 0x7fffffff"
BTW he has a whole video dedicated to that topic, "Hashes 6 Make an integer positive".
hash = hash & 07FFFFFFF
if after taking mod the val is neg then this instruction make it positive
@@guleye I didnt get how that makes it positive
you need to watch video number 30(Hashes make an integer positive) of this playlist. It's really interesting. My brain used hashing to find that videos location. I have some keyvalues such as positive, integer. The position was somewhere in last 15 videos of the current size. I looked for the keys and found Hashes make an integer positive. Than I gave you the entire video content, the huge value.
He basically resets the sign bit.