Lecture 06 - Hash Tables

[@FarahMurad-b8f]

Thank you for your great explanation i followyou from Jordan ❤❤

[@Hamza_1_]

U r the best than my teacher
Thanks a lot ❤

[@moazibrahim5384]

Thank you our great doctor❤️

[@yaramohamed4801]

thanks Dr.. :)

[@masterofpuppetz5790]

Amazing :)
just one question:
if I use a proper hash function(one that doesn't map different elements to the same value), would the performance still degrade to O(n) even if the hash table is completely full?
would collision/clustering still happen in that case?

[@DrMervatMikhail]

When the table is completely full the performance degrade to O(n) when the collision occurs

[@يوسفعبدالقادر-غ3ث]

h(x)=h(y) iffx=y
طيب ما ممكن x!=y ويبقي ليهم نفس ال hash عشان ليهم نفس module بالنسبة لل size

[@DrMervatMikhail]

@@يوسفعبدالقادر-غ3ث ممكن طبعا ما ده collision
مفروض hash الكويس يبقى صعب فيه collision