title: A possible algorithm for determining whether two strings are anagrams of one another?
body: <p>I have this idea (using C language) for checking whether two strings formed from ASCII letters are anagrams of one another:</p>
  
  <ol>
  <li><p>Check if the strings are the same length.</p></li>
  <li><p>Check if the sum of the ASCII values of all chars is the same for both strings.</p></li>
  <li><p>Check if the product of the ASCII values of all chars is the same for both strings.</p></li>
  </ol>
  
  <p>I believe that if all three are correct, then the strings must be anagrams of one another.  However, I can't prove it.  Can someone help me prove or disprove that this would work?</p>
  
  <p>Thanks!</p>