If I have a hash function h(k, f(i)) and
return c * i;
And the first index that it tells me to insert the element at already has an element there, what do I do? Would the proper way to insert an element the first time be
h(k, f(0)) = the index I try to insert the element at.
Then, if there is a collision/an element is already at that index, I would do i += stepwise, and call h(k, f(i)) again?