Assume: an element is equally likely to hash to any of the m slots (Simple Uniform Hashing)
Average runnning time for Chained-Hash-Search:
Time to compute hash function (assume O(1)) | + | Time to search chain |
O(1) | + | O(α) |
O(1 + α) | ||
O(1 + O(1)) | ||
O(1) |