title: What is the time complexity in chained hash table
body: <p>I've a hashtable which consists of 1000 elements and 100 buckets with maximum 100 entries per bucket. Suppose one bucket has 100 entries (i.e. 100 items in the list of that bucket). Now what will be the time complexity in terms of big-O notation if the item I sought is the 100th in the list of the bucket. O(100) or O(n)? Or anything else?</p>