Anagrams?????

You have been given 2 strings str1 and str2. Find whether the strings are anagrams of each other. What will be the test cases??

xor the two strings if output is 0 then print yes else print no.

if two strings are permut of each other then above algo will definately output yes but reverse is not true
1)str1="aaaa",str2="bbbbbb"
2)str1="aa",str2="\0";
and similar strings where we get even number of same chars.
so i think min complexity to sol this for handling all case shud be nlogn (sort it optimally and comp char by char)

This Algorithm can be applied to any no of stings gven and to compute the set of the anagrams in it......

For each word in the list, form a new word by sorting the letters in
that word. Each set of anagrams would have the same
sorted-letter-word.

You could then sort the list of words alphabetically by the sorted-letter-words.

It's order N * log N.

int a[256]={0};
if strlen(s1)=strlen(s2){
while(*s1 && a[*s1++]++ && a[*s2++]--)
;
i=-1;
while(++i<256 && a[i]==0)
;
i==256?"anagram":"not an anagram"
}
else "not an angram

This will work for all test cases in O(n)