title: Hash Table : Search vs successor time complexity
body: <p>In <a href="http://books.google.com/books/about/The_Algorithm_Design_Manual_Text.html?id=TrXd-gxPhVYC" rel="nofollow">Skiena's book of algorithm design</a>, given that the hash table has can have maximum <code>m</code> buckets and total number of elements is <code>n</code>, the following worse case time complexities are observed:</p>
  
  <p>Search: <code>O(n)</code></p>
  
  <p>Successor: <code>O(n + m)</code></p>
  
  <p>Why are the two different? Doesn't finding successor also in a way involve searching the next element?</p>