Search for element with key k in list T[h(x.key)]
Q: Runnning time for Chained-Hash-Search?
A:
Time to compute hash function (assume O(1)) | + | Time to search chain |
Suppose T stores n elements.
Q: Worst-case runnning time to search chain?
A: O(n), in case all n keys hash to the same slot.