How can we get the most effective hash function (the least possible probability of confrontation) for a set of stars?
Suppose we are given some stars. And the length of the wire is also not defined Ajay Vijay Rakhi ....
We do not count the available strings , So we can prepare a hash table of size (counting available) what can be the right hash function that we can design for this kind of problem ??
Multiplying each ASCI value of 31 (primary number) in increasing fashion leads to a hash value of MAX_INT, and then the modulus will not work properly ... So please construct some efficient hash function Give solution.
I have a set of stars, count = 10 says .... I need to implement a hash function such that all 10 strings are typically fitted in the hash table. ... any correct hash function o (1) is available for this kind of problem ?? The size of the hash table for this case will be 10 ...
Only C programming ...
Please explain the logic on the website .... It is very complex but correct me .. !! What is the use of algorithm here ... it is very difficult to read the code directly !!
Thank you ....
you
Comments
Post a Comment