title: Anagram Algorithm using a hashtable and/or tries
body: <p>I have been searching the internet for awhile now for steps to find all the anagrams of a string (word) (i.e. Team produces the word tame) using a hashtable and a trie. All I have found here on SO is to verify 2 words are anagrams. I would like to take it a step further and find an algorithm in english so that I can program it in Java. </p>
  
  <p>For example,</p>
  
  <ul>
  <li>Loop through all the characters. </li>
  <li>For each unique character insert into the hashtable.</li>
  <li>and so forth.</li>
  </ul>
  
  <p>I don't want a complete program. Yes, I am practicing for an interview. If this question comes up then I will know it and know how to explain it not just memorize it.</p>