# When to apply a probe sequence when inserting an element to a hash table

So, if we start out with an empty table with M elements. Do we always need to have a specified hash function say $$h(x) = x \% 8$$ as well as a specific probing sequence to use when inserting a specific element triggers a "collision" ? So, in that way do we always try to use a "standard" hash function first and then only if a collusion occurs we use a specific probing sequence hash function that we choose for that specific table?

Is that the case or do we use the probe sequence even if the table is empty ? I'm just trying to understand if most of the time we have two functions when dealing or creating a hash table or if we use only one throughout the whole sequence of elements that are inserted or searched through.

• There are many variations to this, see Open addressing on Wikipedia. – Juho Sep 7 at 8:58