public class FindAnagrams {

    public static void main (String[] argv)
    {
        // Get dictionary.
        String[] words = WordTool.getDictionary ();

        // We'll count the anagrams found.
        int count = 0;

        // Compare each pair of words.
        for (int i=0; i<words.length; i++) {
            for (int j=0; j<words.length; j++) {

                // Make sure a word is not compared to itself.
                if (i != j) {
                    if ( areAnagrams (words[i].toCharArray(), words[j].toCharArray()) ) {
                        System.out.println (words[i] + " and " + words[j] + " are anagrams");
                        count ++;
                    }
                }

            }
        }
        
        System.out.println (count + " anagrams found");
    }



    static boolean areAnagrams (char[] A, char[] B)
    {
	if (A.length != B.length) {
	    return false;
	}

        // Make a copy.
	char[] C = new char [B.length];
	for (int i=0; i<B.length; i++) {
	    C[i] = B[i];

	}

	for (int i=0; i<A.length; i++) {

	    // Search for A[i] in C.
	    boolean found = false;
	    for (int j=0; j<C.length; j++) {
		if (A[i] == C[j]) {
		    found = true;
		    C[j] = '#';   
		    break;
		}
	    }

	    if (! found) {
		return false;
	    }

	} //end-for

	return true;
    }


}