title: C++ hashing: Open addressing and Chaining
body: <p>For Chaining:</p>
  
  <p>Can someone please explain this concept to me and provide me a theory example and a simple code one?</p>
  
  <p>I get the idea of "Each table location points to a linked list (chain) of items that hash to this location", but I can't seem to illustrate what's actually going on.</p>
  
  <p>Suppose we had h(x) (hashing function) = x/10 mod 5. Now to hash 12540, 51288, 90100, 41233, 54991, 45329, 14236, how would that look like?</p>
  
  <p>And for open addressing (linear probing, quadratic probing, and probing for every R location), can someone explain that to me as well? I tried Googling around but I seem to get confused further.</p>