In class it was mentioned that hash function should work in O(1).
Should it be like this in our cuckoo hashing code?
(to be more specific - when I try to find the most efficient way to insert a key, I want to keep all the ways in order to compare them - so, I have to keep the cuckoo tables I've created so far, which takes O(cuckoo.size))
Thanks