Hashing Technique : its a searching technique, designed using mathematical model of functions. its fastest searching technique. ideal hashing takes O(1)
@@harshsolanki3269 pass the value to the formula and verify the index, if it doesn't contain the desired value then keep on incrementing the I, just like we did for insertion
If this is the first video that came up on your search result on hashing then dont go anywhere else!This is by far the best explanation you could find on youtube.
السلام عليكم Magnificent, you are just magnificent, sir! I was suffering not understanding this hashing crab for almost 16 days, and then I found you, and it has been simplified in 16 minutes, what the heck!
You are my probe of light. You shine your knowledge into my day as I struggle with algorithms in my analysis class. You show me the path towards earning my degree. I owe many thanks to you, yet it will never be enough. One day if our paths crosses, I shall buy you briyani.
Thank You Sir, because of you I am placed in an MNC and looking forward to achieve great things Once again thank you....Your Content is awesome and easy to understand
I would just like to say I really, really like Abdul Bari's teaching technique. I've been in the Silicon Valley as a developer for almost 20 years, and I wish there were more teachers like Abdul. He has a very graceful style of teaching that I wish more teachers would adapt. I like that he doesn't just jump into material, instead he says "I'm going to teach you X, Y, and Z", and then he repeats "this is how you do X, Y, and Z", then he teaches the material. I don't care how long you've been in the computer science field, there's always something to learn from someone, and Abdul has a lot of good lessons to teach.
Ovidiu Sampalean Ovidiu Sampalean il y a 11 mois (modifié) 2:10 - hashing 3:51 - hash table 6:00 - hash function 7:00 - collision 7:47 - chaining 9:49 - linear probing 14:04 - quadratic probing linear quadratic 46 Muhammad Taha Haqqani Muhammad Taha Haqqani il y a 2 ans Your explanations are so clear and to the point. Thank you Sir for being so patient and explaining everything so well! 21 Bharati Gupta Bharati Gupta il y a 6 mois
If you want to know if a range of integers has been seen or not already on input, an array of flags would suffice. You could just prescan the array to determine the lowest and highest values (such as 3 is the lowest and 50 is the highest), then you can just make the array from 3 to 50. Space is not really an issue but if you had a low of 3 and a high of say 1 million and not much in between, you could have an "on the fly" hash function that modifies itself to force "oddball" numbers into a smaller space "on the fly" with minimal collisions.
very good explanation Sir !!!!!!!!!!! Keep making this type of videos. I have seen All your Algorithm Analysis videos. I am a huge fan of your teaching style !!!!!!!!!!
Excellent explanation, you explain all the concepts in such simple manner.I was having tough time understanding datastructures and alogorithms but thank god i found your videos.Lots of respect to you sir. ~ from Venkatesh.
i was thinking of joining a course to learn data structures and algorithms, and they were asking 21,000 rupees.I was almost going to join when i found your videos.
The hash functions or algorithms for linear and quadratic probing to resolve Hash Table index collisions are interesting. Excellent explanation. One use case where Mathematical models are used to resolve data search collisions.
Thank U soo much sir ! When I open the book & some other channel for this topic My mind was boomerang! But after watching this just .. just 30 minutes I learned entire concept very very easily like peeling banana ! What an explanation sir G ! Thank u so much !
If we had teachers like him in colleges like IP University then we would have no need of going to coaching only e college lectures would suffice for our success 😓
Thank you for your clear explanation. :-) One question I had is regarding quadratic probing. You said that it helps to avoid collision element clustering -- and it did, but it seems that it still requires the same number of lookup steps as it would need if linear probing had been applied and clustering had occurred. Ex: Suppose, as in the last example, that the key space is: 8, 3, 13, 23, 43, 10. Then, using linear probing: 3 is stored at index 3, 13 is stored at index 4, 23 is stored at index 5. // That's 3 index checks: h'(x) = [h(x) + f(i)] % 10, for f(i) = i, where i = 0, 1, and 2. Using quadratic probing: 3 is stored at index 3, 13 is stored at index 4, 23 is stored at index 7. // That's 3 index check: h'(x) = [h(x) + f(i)] % 10, for f(i) = i^2, where i = 0, 1, and 2. So, I'm wondering what the benefit is of using quadratic probing to avoid collision clustering? It still requires the same number of basic computations to lookup and element, it seems.
