A

Admin • 833K Points
Coach

Q. Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?

  • (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

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.