As a homework problem, I'm trying to create an implementation of a hashmap using an array. I'm using .hashCode() to create the hash, and I need to find a way to resolve collisions.
I thought of using double hashing, but I can't find a way to do that in Java. I've also tried searching on SO, but most of the questions are discussing how collision resolution is handled etc, rather than how to implement a solution. Would anyone be able to point me to any simple alternatives if there isn't a library to perform double hashing?