Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?
Posted: Thu Jul 14, 2022 8:47 am
a) All keys hash to same index
b) All keys hash to different indices
c) All keys hash to an even-numbered index
d) All keys hash to different even-numbered indices
b) All keys hash to different indices
c) All keys hash to an even-numbered index
d) All keys hash to different even-numbered indices