1 votes 1 votes A hash table is used when number of keys actually stored it any point of time is small as compared to the number of possible keys. please explain this line with suitable example. Programming in C hashing data-structures + – once_2019 asked May 5, 2018 once_2019 289 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes It means number of keys to be inserted in the hash table should be less than or equal to the hash table size for example-if there are 10 keys {1,2,3,4,5,6,7,8,9,10} then the size of hash table should be greater than or equal to 10. Anil Ji answered Jun 16, 2018 Anil Ji comment Share Follow See all 0 reply Please log in or register to add a comment.