To insert an item with open addressing, we also start with the slot at f(k,0). If that slot is already in use, then we try the slots at f(k,1), f(k,2) and etc. The repetition stops when we find the first slot f(k,i) that is not in use, or when i ≥ n.
If we do find a slot that is empty, then we store both the key and the value into that slot, and mark it as “in use”.