title: What's the worst case running time of Hashing with Chaining?
body: <p>Suppose the number of hash table slots(say n) are proportional to the number of elements in the table(say m). We have n = O(m), 
  load factor l = O(m)/m = O(1)
  So Under the assumption of <strong>Simple Uniform Hashing</strong>, Searching takes constant time on an average. Which means on an average searching takes time proportional to the length of the linked list which is same for all slots and hence constant time. But what about the worst case running time under the assumption of <strong>Simple Uniform Hashing</strong>. Is it also be constant or it'll O(1 + l). Please explain I'm confused. [Reference CLRS Page 260]</p>
  
  <p>Does worst case time for Un-successful Search under the assumption of Simple uniform hashing will be same as average case time. And worst case time for successful Search under the assumption of Simple uniform hashing will be different than average case time. </p>