Any bored java programmers? IF so, talk to me about Hashing!!

[SnoopCat]

Any bored java programmers? IF so, talk to me about Hashing!

PM if u think u can help

 

[gregulator]

well make an array of some size much larger than the data you want to store and then think of a way to make a numerical representation for the information you want to store (a hash function). this function should "hash" to a value within the range of the array (i.e. use a mod function). then you will need some sort of collision policy that will map objects that have the same hash value to a different location (you could do something like add one to the hash function value but this would be inefficient). so that is a very broad description but it should give you a start...

 

[SnoopCat]

bump

 

[Kadesh]

I think there's a built in library for this. The only reason I remembered this is because someone was complaining that they even included a hash function but not Quick Sort. I'd search the Java doc's but the last time I tried to download the SDK, their ftp was down. Maybe someone who has them can search it.