in Programming
2,792 views
3 votes
3 votes

The average search time of hashing, with linear probing will be less if the load factor

A. is far less than one

B. equals one

C. is far greater than one

D. none of the above

in Programming
2.8k views

1 Answer

5 votes
5 votes
Best answer

A. is far less than one

 Explanation

Load factor is the ration of number of records that are currently present and the 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.

selected by

Related questions