title: Best string hash function for this example
body: <p>i have a key with type AcccAA where A-[A...Z] (capital letters), and c is [1..9]. i have 1500 segments.
  Now my temp hash function</p>
  
  <pre><code>int HashFunc(string key){   
      int Adress = ((key[0] +  key[1] + key[2] + key[3] + key[4] + key[5]) - 339) * 14;
      return  Adress;
  }
  </code></pre>
  
  <p>and Excel show a lot of collision in center (from 400 to 900)</p>
  
  <p>Please tell me the hash function to be more evenly.</p>