title: Time Complexity of Hash Tables in C
body: <p>I'm fairly new to the the concept of hash tables, and I've been reading up on different types of hash table lookup and insertion techniques.</p>
  
  <p>I'm wondering what the difference is between the time complexities of linear probing, chaining, and quadratic probing?</p>
  
  <p>I'm mainly interested in the the insertion, deletion, and search of nodes in the hash table. So if I graph the system time per process ( insert/search/delete process ) versus the process number, how would the graphs differ?</p>
  
  <p>I'm guessing that:
  - quadratic probing would be worst-case O(nlogn) or O(logn) for searching
  - linear probing would be worst-case O(n) for search
  - Not sure but I think O(n^2) for chaining</p>
  
  <p>Could someone confirm this? Thanks!</p>