Hello mam Actually it's my father id And i am using it. I am messaging you because even I am aparna 😅 currently I am a sophomore at nit kurukshetra😅. So I am your junior😅
@@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
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
السلام عليكم 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.
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.
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.
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.
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 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.
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 😓
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 !!!!!!!!!!
Your videos are best sir. Thanks for explaining in such a well manner. But I've one correction. You said it'll be definitely less than O(logn) but worst case of hashing is O(n) so it can be greater than O(logn).
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 !
I liked the video but I have doubts if with linear and quadratic probing all slots are filed in hash table then what will happen do we have to increase the size of hash table or what?
super cool video. very nicely explained. can u talk more about why clustering of elements around collision point is bad and hence quadratic probing is preferable?
Probably because in linear probing you'd have to go through a lot of unnecessary elements whose h(x) in h'(x) wasn't the same as the element you're searching for because you keep looking until you find the vacant space.
Using the quadratic probing, what happens if you are forced to index something in a position that is outside the range of your hash table? For example if because of other collisions, using the hash function, it tells you to index something at index 12, but your array only goes up to 9? Thanks for the help, this was a great video!
The modulus is taken after the functions are added. Thus, there is no value of [ h(x) + f(i) ] which when the modulus is taken can be greater than the number of entries in the hash table. The value of a mod b will always be less than b.
![HIWWHEE | OHM [Official MV]](http://i.ytimg.com/vi/OJJLtTLqLag/mqdefault.jpg)
Such a clear, crisp, no-nonsense explanation. Hats off, sir.
Exactly
th-cam.com/video/fPqYoe4YP14/w-d-xo.html
Hello mam
Actually it's my father id
And i am using it.
I am messaging you because even I am aparna 😅 currently I am a sophomore at nit kurukshetra😅.
So I am your junior😅
Whenever i want to see any topic on youtube. I pray that u uploaded a video of that concept. Thanks a lot sir.
I'm an IT grad and have just begun learning cs on my own. You, sir, are a blessing.
IT grads aren’t taught all this in the course ?
@@84y87same question coz I'm still an undergrad IT but this is in our 2nd year curriculum 1st sem
@@potatoisme1178 I'm in 3rd year now lol, can confirm all this is pretty basic stuff and all IT grads, at least in my college were taught this.
Thank god for you indian guys with your yt videos
DaL I love India🤩
i love india (2)
INDIA FOR LIFE MAN. SAVE ME THROUGH ALL MY CS MODS PLS~
India is the best!!!
I have never seen such a clear explanation of hashing. My search ends here! Thank you Prof.!
omg it sounded similar and so good, then i found out, oh! you are the tutor who teach C++ on udemy! btw you are soooo good.
Glad I could help!
@@abdul_bari can you explain how to search after appying quadratic probing
@@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
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
How’s ur programming concept ?
Your explanations are so clear and to the point. Thank you Sir for being so patient and explaining everything so well!
My whole unit in 17 minutes ......just wow! Truly appreciate it man.
السلام عليكم
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!
This was a way better explanation then the author of "Cracking The Coding Interview" explained it. Great job!
Everything's so crisp ...precise and to the point . Your lectures are really an elixir for passing dsa . Couldn't be thankful enough 🙂
I have used this channel throughout my undergrad and for preparing for interviews. It has been extremely helpful. Thank you so much for this. ::)
you are really one of the best instructors of algorithms Sir!
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.
The clearest explanation after watching many videos with no idea what they are talking about. Thank you
Along with Professor Leonard for mathematics, you are a life-saver for us regarding Data Structures. sir. Bravo!
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.
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.
Thank you sir, we could clearly see that you have put some extra efforts in this video, and we genuinely appreciate that.
th-cam.com/video/fPqYoe4YP14/w-d-xo.html
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
thank u
God you just saved me at least an hour with the slides of my prof lol. Thank you and god bless you
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
happines is when we search any topic and find the video of mr abdul bari sir... well done sir..GOAT LEVEL EXPLANATION ❤😊
Here, one of the most important concepts in computer science is very well explained by one of the greatest professors! Thank you!
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.
You are GOD sir.....for basic DSA concepts....the topics which I was fearing for 1 year..you made so effortlessly easy...Thankyou so much sir...
Thank you sir! I have paper at 1'O Clock and I'm watching this video at 11. But totally confident about this concept...
If you have an exam tomorrow, skip to 3:53 😃😃
Abhinav Sharma I don't have it tomorrow I have it today in 20 minutes 😭😭
Sanpreet Kaur hahahaha 😂
then you must have to skip the whole tutorial
same here3 :(
today*
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.
this is the best explanation that i have seen in my career for hashmap in java
No it's in ruby
How are you this good at explaining these concepts? I'm blown away
better than my professor in college
hahahahahaha
These videos are saving me big time, I have a final for data structures tomorrow
Linear probing ,quadratic probing and open addressing, perfect!
Recommendation: The perfect playback speed is 1.5x.
for me it's 1.25 xd
For me 2x
@@Shy0553 0.25x
better at normal pace
No words to express my gratitude Sir 🙏 ....May Almighty shower His choicest blessings upon you n ur family....Thank U Sir....🙏💐
Hashing done in 17minutes. Thank you for making this video.
Sir u the best teacher .. even our data structures teacher follows you only
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.
Great, every question that popped in to my head was answered and explained a few seconds after, through the entire video!
Koi jawab nhi aapka..Ek tarfa padaya apne..Thanks sir
excellent explanation !!. Clear and straight to the point. Took me 10 minutes to understand what I could not understand in school for 3 hours.
Brilliantly explained Linear Probing & quadratic probing ... 🤩🤩😍😍🥰🥰🤩😘😘😘
Sir Your all videos are very simple to understand and full of knowledge.thank you for making such videos,🙏
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.
Very thank you sir..after listening Ur class I get clarity on this topic.very clear explanation.
nice video , 100% recommended
to learn hashing and its functions
Hashing has never sounded so easy🥰🥰
Very clear explanation. Please continue posting more videos. It was very helpful.
Sir try to arrange your videos sub-topic wise. Like for tree,graph,algo etc.
Your explanation are awesome.
Best Teacher and best lecture over youtube for any kind of problem
OMG sir,, this is super osm!!!!
I just loved the content. Please make more videos!
REAL TALENT!
I like the video by default whenever I this man has recorded it as I'm sure I will clearly get the answer I'm looking for.
Shaandaar explanation....
Very helpful video
Thank you so much sir.
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 😓
best explanation I've seen so far
Thank you very much sir for making hashing concept crystal clear..... please do keep making videos like these
you might actually be the greatest to ever do it
You literally saved me sir, you are such a masterpiece🙏🙏🙏
Thank youuu soo much sir, you're amaazing!!!👌👌👌
your teaching method is really very very much effective.thank you so much sir
Sir Hats off to your explanation. Thanks for existing.
wow you are just so good. this is the best video about hashing I have watched.
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 !!!!!!!!!!
man that was next level explanation
Sir you really a good teacher ❤
A newbie like me was able to understand. Thanks a lot :)
You are the best teacher in this youtube. What a fantastic explanation in such a short time. #Woow #HatsOff
Very simple and excellent explanation.
Beautiful explanation, must watch if u r new to hashing.👌👍
best video on hashing on the planet
This is pure gold.
Thankyou sir!!
big thank you , I have just discovered your amazing helpful valued channel. Many thanks from Egypt :)
i wish you were my father
????
😂😂😂
You have your father, god has given...
But guru is a valuable asset ❤
The most helpful video about hashing. Thank you so much, Sir. Keep up the good work!
th-cam.com/video/lzS_DiMlR2Q/w-d-xo.html
this is so goood even after 7 years. thank you
text book sucks!!
Your videos are best sir. Thanks for explaining in such a well manner.
But I've one correction. You said it'll be definitely less than O(logn) but worst case of hashing is O(n) so it can be greater than O(logn).
Exactly what I was thinking. What if all the elements have same mod and we have a single linked list with all the elements. in that case its O(n)
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 !
sir words cannot discripe how staight, clear your explanation is ... thank uuuuu
Sur give a really good explanation of every topic hats off for u sir
Damn excellent explanation.. Even 7 years later. Thanks!
I gone through multiple hast table logic video, but this is gives nice explanation.thank you
Your explanation is elaborative and in depth..thank you sir 🙏🙏..
Hope you make more videos your explanation is really clear and simple , thanks a lot
Fantastic tutorial
I really learnt what hashing is
pedantic explanation...good job
What an absolutely fantastic explanation. Thank you!
Thank you so much. Your video will make me pass this course. May god bless you.
super sir. The best training about Hashing . So simple and an easy you made it......!!!!
Awesome explanation. Thank you Abdul.
thank you so much for your clear and concise explanation!
Thank you brother. Such a good detailed instruction to Hash Tables and Techniques.
Awesome video...i was not aware of quadratic probing. Thanks
I liked the video but I have doubts if with linear and quadratic probing all slots are filed in hash table then what will happen do we have to increase the size of hash table or what?
This is truly fast forward learning in fast world. Thanks.
super cool video. very nicely explained. can u talk more about why clustering of elements around collision point is bad and hence quadratic probing is preferable?
Probably because in linear probing you'd have to go through a lot of unnecessary elements whose h(x) in h'(x) wasn't the same as the element you're searching for because you keep looking until you find the vacant space.
no one can give a better explanation than this one
Sir what about 43 in quadratic probing?? It will be stored at 2nd index, but then how to search for an element?
Same doubt
Using the quadratic probing, what happens if you are forced to index something in a position that is outside the range of your hash table? For example if because of other collisions, using the hash function, it tells you to index something at index 12, but your array only goes up to 9? Thanks for the help, this was a great video!
same question
The modulus is taken after the functions are added. Thus, there is no value of [ h(x) + f(i) ] which when the modulus is taken can be greater than the number of entries in the hash table. The value of a mod b will always be less than b.
@@HippieDreamsWV But there can still be a situation where array space gets used up. Is the array length increased dynamically to solve that?
this is the one i found the bestest lecture