title: How to choose size of hash table?
body: <p>Suppose I have 200.000 of words, and I am going to use <code>hash*33 + word[i]</code> as a hash function, what should be the size of table for optimization, for minimum memory/paging issue?</p>
  
  <p>Platform used - C (c99 version), </p>
  
  <p>words are English char words, ASCII values</p>
  
  <p>One time initialization of hash table (buckets of link list style),</p>
  
  <p>used for searching next, like dictionary search.</p>
  
  <p>After collision , that word will be added as new node into bucket.</p>