title: anagram algorithm is returning duplicate values
body: <p>I've been developing an algorithm to calculate anagrams for a given (set of) word(s). I just got it to work, with ONE incredibly frustrating exception (no pun intended; there is no actual exception being thrown). Despite my attempts to utilize effective "pruning" to decrease the number of repititions, <strong>my algorithm is adding duplicate to the master list, in this case an object of type final static ArrayList(StringBuilder)().</strong> I can't seem to figure out why this is happening. Below is my code; i decided to post the entire method for convenience.</p>
  
  <p><strong>This is an assignment for school, so rather then a straight answer/solution, I'm looking for guidance/conceptual mistakes on my end.</strong> </p>
  
  <p>EDIT: (code edited out to avoid possible plagiarism prior to the assignment's due date.)</p>
  
  <p>Here is an example:</p>
  
  <pre><code>**input:**
  pnxish
  bauelqbs
  coxiuqit
  elbarcbs
  ptos
  
  **output:**
  Now printing anagrams: 
  Anagram #0: sphinx
  Anagram #1: squabble
  Anagram #2: squabble
  Anagram #3: quixotic
  Anagram #4: quixotic
  Anagram #5: scrabble
  Anagram #6: scrabble
  Anagram #7: pots
  Anagram #8: post
  Anagram #9: tops
  Anagram #10: opts
  Anagram #11: spot
  Anagram #12: stop
  </code></pre>
  
  <p>Thanks for the help! :)</p>