1 votes 1 votes The average search time of hashing, with linear probing will be less if the load factor : is far less than $1$ equals $1$ is far greater than $1$ none of the options Algorithms nielit2017dec-assistanta algorithms hashing + – admin asked Mar 31, 2020 • edited Aug 24, 2020 by Lakshman Bhaiya admin 2.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes The average search time of hashing is O(1). Load factor is the ratio of number of records that are currently present and total number of records that can be present. If the load factor is less, free space will be more. This means probability of collision is less. So, the search time will be less. the load factor of hashing Is strictly far less than 1 https://gateoverflow.in/185239/nielit-set-c-106 https://gateoverflow.in/337209/nielit-2016-mar-scientist-c-section-c-56 Mohit Kumar 6 answered May 20, 2020 Mohit Kumar 6 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes option A) far less than 1 Sanandan answered Sep 9, 2020 Sanandan comment Share Follow See all 0 reply Please log in or register to add a comment.