2 votes 2 votes The average search time of hashing, with linear probing will be less if the load factor is far less than one equals one is far greater than one none of these DS nielit2016mar-scientistc data-structures hashing + – admin asked Apr 2, 2020 • recategorized Oct 28, 2020 by Krithiga2101 admin 871 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes load factor mostly let you know how full the hash table is. So, while in linear probing, the search will take time if the consecutive probes are there. Thus I think, we can go with option c. Nihal Singh answered Sep 9, 2021 Nihal Singh comment Share Follow See 1 comment See all 1 1 comment reply Psy Duck commented Aug 6, 2022 reply Follow Share load factor for open addressing techniques cannot be greater than 1! 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Load factor tells the average number of keys per slot. That means, if load factor is large, collisions become frequent. And as it is a linear probing. We may have to traverse around in the array to find the element. if load factor is very less. That means there are more slots than keys. So we may get the element on the first search only. That’s why Average Search Time will be less. ritwikritwik answered Jun 12, 2022 ritwikritwik comment Share Follow See all 0 reply Please log in or register to add a comment.