title: Hash Table Insertion Time Complexity Confusion
body: <p>I understand that insertion for hash tables is O(1) and sometimes O(n) depending on the load factor. This makes sense to me, however, I'm still confused. When talking about insertion, are we including the hash function in that measurement or is it just placing some value at that index? For ints, I could see how it could be O(1), but what about strings or any other objects?</p>
  <p><strong>Edit:</strong> This seemed to answer my question, sorry about the confusion.
  <a href="https://stackoverflow.com/questions/31549669/time-complexity-of-creating-hash-value-of-a-string-in-hashtable/31555165#31555165">Time complexity of creating hash value of a string in hashtable</a></p>