When calculating the load factor of a hashtable with an open-addressing array implementation I am using:
however it occurred to me that since deleted entries must be marked as such (to distinguish them from empty spaces), it might make sense to include these in the number of keys.
My thinking is that as far as estimating the average number of probes to find an entry, deleted entries should count towards the load factor, but as far as inserting a new key they should not.
Which is the proper calculation: including deleted keys or not?
© Stack Overflow or respective owner