title: Hash table runtime complexity (insert, search and delete)
body: <p>Why do I keep seeing different runtime complexities for these functions on a hash table? </p>
  
  <p>On wiki, search and delete are O(n) (I thought the point of hash tables was to have constant lookup so what's the point if search is O(n)). </p>
  
  <p>In some course notes from a while ago, I see a wide range of complexities depending on certain details including one with all O(1). Why would any other implementation be used if I can get all O(1)?</p>
  
  <p>If I'm using standard hash tables in a language like C++ or Java, what can I expect the time complexity to be?</p>