Hi,
As the title, my questions is about hash table. I implemented all functions to be used in open addressing - quadratic probing. I created the hash table with initial size entered by me, and then when the table is 80% full, I do rehashing. And, it works fine. But, I'm thinking of something that when I delete some elements and there are no need for bigger size, how can I resize the hash table to the previous size?
For example, the current size is 23, and the number of elements is 8, I think 10 is enough. Or should I take the first prime number after 8? I think this works fine. And, I'm asking for guidance in this case.
