What is the average case cost for a search on a properly tuned hash system that stores n records?

\Theta(1)
  • \Theta(n^2)
  • \Theta(n)
  • \Theta(\log n)

If the system is working right, you should only need to look at one slot most of the time, or occasionally a couple of slots.