anagram

How would you list words that are anagrams of each other? I was asked this question when I applied for my current job. orchestra can be rearranged into carthorse with all original letters used exactly once therefore the words are anagrams of each other. Put all the letters in alphabetical order in the string (sorting algorithm) and then compare the resulting string. -Adam Good thing we all live in the C# reality of in-place sorting of short words on quad core machines with oozles of memory. :-) However, if you happen to be memory constrained and can't touch the original data and you know that

I have this idea (using C language) for checking whether two strings formed from ASCII letters are anagrams of one another: Check if the strings are the same length. Check if the sum of the ASCII values of all chars is the same for both strings. Check if the product of the ASCII values of all chars is the same for both strings. 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? Thanks! I wrote a quick program to brute-force search for conflicts and found that this

Basically, Anagrams are like permutation of string.E.g stack , sackt , stakc all are anagrams of stack (thought above words aren't meaningful). Anyways you could have understood what I basically meant. Now, I want a list of anagrams given million words or simply say from a dictionary. My basic question is Find total number of unique anagrams in a dictionary? Sorting and comparing won't work as it's time complexity is pretty bad. I thought of using hash table, string as key. But the problem is what should be the hash function ? It would be helpful if some pseudocode provided. Some other

I would like to make anagram algorithm but This code doesn't work. Where is my fault ? For example des and sed is anagram but output is not anagram Meanwhile I have to use string method. not array. :) public static boolean isAnagram(String s1 , String s2) { String delStr=""; String newStr=""; for(int i=0;i<s1.length();i++) { for(int j=0 ; j < s2.length() ; j++) { if(s1.charAt(i)==s2.charAt(j)) { delStr=s1.substring(i,i+1); newStr=s2.replace(delStr,""); } } } if(newStr.equals("")) return true; else return false; } sampson-chen An easier way might be to just sort the chars in both strings, and