Hashing - Quadratic Probing for Collision Resolution
HTML-код
- Опубликовано: 6 сен 2024
- This video lecture is produced by S. Saurabh. He is B.Tech from IIT and MS from USA.
Hashing - Quadratic Probing for Collision Resolution
To study interview questions on Linked List watch • Programming Interviews...
To prepare for programming Interview Questions on Binary Trees
• Programming Interviews...
To study programming Interview questions on Stack, Queues, Arrays visit
• Programming Interviews...
To watch all Programming Interview Questions visit
• Programming Interviews...
To learn about Pointers in C visit
• Pointers in C (All you...
To learn C programming from IITian S.Saurabh visit
• C Programming Tutorial
A very simple video to follow, feels great to understand the basics behind linear and quadratic probing. So I just wanted to say thank you and that what you are doing here is awesome, and incredibly helpful to people interested in such things.
I enjoyed your tutorial at 2X speed ;-)
+cheno sebu lol i just tried it it's better :D
cheno sebu yaaas
I know Im pretty randomly asking but does anyone know a good site to watch newly released movies online ?
@Raul Jasiah I watch on FlixZone. Just search on google for it =)
@Ivan Issac Definitely, been watching on flixzone for since april myself :)
4:28 voice cracked haha, great tutorial
it happens to us all
skip to 5:45
+Slick Persian Thanks
My teacher showed us a different function for quadratic probing. h(k,i) = (h'(k)+(c_1)i+(c_2)i^2) mod TABLESIZE. Yours makes way more sense
we are not using closed hashing in quadratic probing but open addressing and linked list method is direct chaining
dude thanks, this helped me understand this so much easier than the textbook
Thanks!
Just one question, when you wan't to find a value inside the hash table, do you follow the same function used and add on i if it's not found?
// Alex
Excellent Playlist for hashing really understood Thanks Sir!
How would you find out at which index your value has been inserted?
nice video.. so in stead of trying just the next you try 1,2 ,4, 9 etc
for your open hashing is it not 33, 13, 3 since the keys get added to the head of the linked list?
Hello,
You explained everything really nice but what if the hash table gets filled in both Linear probing and Quadratic probing ? whether to restructure the whole hash table ?
what if there is already something at index 9 and and you want to put something there?
there is one problem with this quadratic method, if we have 11 numbers to fit in 10 slots, what will happen then?
thanks for the video, it helps a lot for my exam
Loved these tutorials - really really good work!
Thank-you very much. Clear and very useful. Although you didn't mention that f(i) = i squared, but I understood it anyway. :)
What were u listening??? He clearly mentioned :D
Thank you for sharing. I am an student and it's very helpful to me.
I predict that now you are doing a job,hhaha
Thank you so much. it was enough easy to get the points.
Thank you very much. Now it makes more sense!
But sir ,in quadratic there is no guarantee that array will be full
please correct if i m wrong
Great one! Really useful.
Great job, I really understood !!
awesome explain
thanks a lot
Doubt: Why are you taking i=1 and no other number?
Just to do in systematic way
Thanks, your video helped a lot!
thank you very much it was really helpful!!
Good fucking shit, I was making the mistake of counting the squared values on top of the module value + previous added squared
very good
Thank you so much 😀
thanks dude
why so fast ? this video is not help me all
thanks i have paper in two hours
in 54 case we don't have 13 so what should we do
+ali hasan If we do the original hash function on 54 we get 4 but position 4 is already occupied so we begin quadratic probing... (4 + 1^2) % 10 = 5 but position 5 is already occupied... (4 + 2^2) % 10 = 8 but position 8 is already occupied... (4 + 3^2) % 10 = 3 but position 3 is already occupied... (4 + 4^2) % 10 = 0. We are in luck! 0 is not occupied so we place the value 54 at position 0.
thanks!
sir also code it
thanks
tankhssss sir
Gracias!:D
bhai thoda taiz boola kar na, 2X par bhi normal lag raha tha
hey u jus left out 54
but tutorial was awesome
it will be at 2
please stop saying ok