Thanks to geeks for geeks . Everyday when I commute , I watch data structure or algorithm lecture . It's short but clear

You are an incredible teacher. you made that very simple.

very easily explained. thank u so much.. and your voice is too sweet :)

Thank you so much this is extremely clear and concise!

Clearly understand concept, thank you !!! for this video.

Very good tutorials, teacher! But please, increase the mic volume. Sometimes it's very hard to listen it clearly. Thanks for the awesome content!

@konnorzayn5097

3 жыл бұрын

I realize it is kinda off topic but do anybody know of a good site to stream newly released tv shows online?

@orionhenrik3439

3 жыл бұрын

@Konnor Zayn I watch on Flixzone. Just google for it =)

@graysonbeckett2305

3 жыл бұрын

@Orion Henrik Yea, I have been using Flixzone for since march myself :)

@konnorzayn5097

3 жыл бұрын

@Orion Henrik thank you, I went there and it seems like a nice service :) Appreciate it!

@orionhenrik3439

3 жыл бұрын

@Konnor Zayn No problem xD

THANKS THIS HELPED VERY MUCH!!!

thank you for this video your voice is too sweet .

This guy is best teacher at GFG

suppose i stored 3 phone numbers in hash table with hash value 1 using chaining then how can i retrieve data related to 2nd phone number?!!

as we will have keyvalue pairs,where should we have to store values? thankyou

very-very nice explanations

thank you so much for the explanation. but in 6:37 what does link addresse stands for ?

sir, can you explain what is cache performance ..thanks.

The important part is missing and that is how do you retrieve values from the collision array. When hash function is used, you will recieve array. You need to store key value pairs. Then you have to go through whole array and compare wanted key with keys in stored key-value pairs (classic sequencial search with O(n) complexity). That is reason, why worst complexity is O(1+k), where k is number of elements in collison array for specific key and 1 stand for constant complexity of hashing function.

@RM-lb7xw

3 жыл бұрын

Why would you need to sequentially search for the key? The wanted key would be hashed by the hash function again and we'd get the index from it. Since the index is generated, accessing that index would cost O(1).

@CarlosArnauRos

2 жыл бұрын

@@RM-lb7xw Each cell points to a linked list of hashed terms, so if you had 10 collisions you would have to iterate a linked list with said terms, where the complexity would be O(n)

@nqnqnq

Жыл бұрын

​@@CarlosArnauRos regarding O(1+alpha), i believe the maker of the video referred to the average case, not the worst case. indeed, the worst case is O(z), where z is the size of the biggest linked list found in the table. edit: matter of fact, worst case is Θ(z)

hi, thank you so much for the detailed explanation. I had one question, who decides which collision technique is to be used?

@abhijeetkumar2204

5 жыл бұрын

We use best Technic

great explanation, thankyou :)!!

@GeeksforGeeks I was wondering what will be the maximum number of collisions caused by the above insertions. Would it be 3 (total number of collisions) or 2 (maximum collisions at any key). Thank you.

@siddharthmagadum16

4 жыл бұрын

3

number of keys stored in table is n=7 but what is m here exactly? number of slots as in, number of occupied slots(4+3) or the total number of slots(which is 7+3=10 here) or do we really consider the extended nodes as slots?

@aoshinomori

6 жыл бұрын

Mahendra Seth n = number of keys m= number of slots

@neelkamal811101

5 жыл бұрын

same doubt for me .......someone pls clear this doubt...

Since its a key-value pair. Suppose if we have three phone numbers belongs to the same hash and stored values in a linked list. How to know which data belong to which key since the index is the same?

@enterb7643

4 ай бұрын

You perform a linked list search. That's why the expected time complexity for search is O(1 + a), where a is the average number of stored values assigned to one hash. In the worst case, all the values in a hash table will be assigned to one hash, so the search will take O(n) time.

Thank you Geeks for Geeks :)

is it necessary to use linked list or we can use vector

4:37 we therefore put "73" not 3

WOW, YOU ARE GREAT :)

Thank you very much your video helped me a lot

@GeeksforGeeksVideos

7 жыл бұрын

Thanks Drilondfc. We're glad that we could be of any help.

Insertion will take only O(1) worst case time when we always insert at beginning of list

How we can create hash table? please include that also because majority peoples have no idea about hash tables, and its creation. Thank you for your tutorials.

Thank you so much 🙏🙏

What will be there in the remaining empty spaces if no elements are filled??? How should we initialise it first?

@DrSupes

4 жыл бұрын

GAURAV NAGA MAHESWAR PATTEM they are set as NULL

Gracias, realmente entendi bastante

what is expected number of probes in unsuccessful search??????

5:02 So I understand the hash table diagram showing the keys, but where are the values?

great tutorial sir

@GeeksforGeeksVideos

6 жыл бұрын

Thanks :)

Thanq very much 🙏🏻🙏🏻🙏🏻🙏🏻✨

What is Cache performance?any one answer plz

I understand this concept but how does it know how to get the right value from the linked list?

@muhammedbayram4624

3 жыл бұрын

It does linear searching in linked list.

Im confused. I thought we would use the Key to calculate the hash code, find an index and insert a value not insert the key itself???

Hash functios is a pre defined function

bro this is awesome !!!!! hi can u tell at 5:43 what the third point is trying to convey ?

@kendrickjg

6 жыл бұрын

He is basically saying that the hash function used to determine the key doesn't matter because you always have a way to add an element to that slot.

Well explained

1:06 How can index for array/linked list be a String ? 🙄🙄

Explanation is simpler and easier.

How is the time complexity O(1+a) ??

@panoskatsos5454

4 жыл бұрын

the hashing algorithm has complexity O(1) when searching and inserting elements cause we only do one calculation to determine the hash . The separate chaining has this complexity + the average slots the algorithm has to pass to insert or find an element. But with that said constants are ignored in big O notation, therefore, the complexity is again O(1) even if it is not addressed in the video

how can be the time complexity O(1)?? coz we need some time in order to search for the key in the hash table... lets say that we have hash table of size T so its time complexity should be O(T)....?? right

@2fast4uspartan

6 жыл бұрын

Hash table lookups/searches are O(1) b.c. your key serves as an input to a hash func which will output an index at which your value will be placed. Hash func takes O(1) time.

@kendrickjg

6 жыл бұрын

It's O(1) because you find your element in the table like this: element = hashtable[key]. It's constant time to search for the FIRST element in the chain.

Hey, please explain again how you find the complexity

Voice of video is not clear, so please fix it.

so.. no comment about the caption?

why u always taking mod 7

bade sweet sound karte ho bhai aap😂🙏

WHY X IS BEING MOD BY 7? I CAN MOD BY ANY INT??

@apanuragp7

4 жыл бұрын

Yes you can use any integer but Prime numbers are preferred mostly as they reduce the number of collisions thereby reducing the size of LinkedList and to be more efficient you should choose a prime number that is not closer to the numbers which are powers of 2

Sir slow understanding.no clear voice.

abe tej bole????

Contributed by Illuminati? Lol

Can u talk normally?

why are you taking such breaks between words, it makes listener feel dumb

@Prince-hx2pt

7 ай бұрын

🤣🤣🤣

Please have someone else do the videos. This way of explaining, the rythm in which he is talking is really irritating and too slow.