gudni12345
asked on
Separate chaining to resolve collisions
I neew to write a C++ program that inserts N random integers into
a table of size N=100 using separate chaining to resolve collisions, and
then nds and prints the length of the shortest and longest lists for
N = 10 3 (in power of three)
a table of size N=100 using separate chaining to resolve collisions, and
then nds and prints the length of the shortest and longest lists for
N = 10 3 (in power of three)
Sounds fun. Did you have a question?
ASKER
Sorry!!.The question is how. I do know how to insert the random numbers in to af table but how to use separate chaining to resolve collisions, and then find and prints the length of the shortest and longest lists., that is a mistery for me.
Hilsen
G.
Hilsen
G.
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.