Implementation of an anagram function in C#

Question

Possible Duplicate:
What is an easy way to tell if a list of words are anagrams of each other?

What is the best way (performance wide) to write a function in C# that takes two strings and returns true when the strings are anagrams of each other and otherwise returns false. Example of anagrams are:

abet beat beta bate
abides biased

anagrams link

In implementing this, is it possible that there is space in each string?

Any idea would be very much appreciated!

Answer 1

A simple (naïve?) way, using LINQ:

"abides".OrderBy(c=>c).SequenceEqual("biased".OrderBy(c=>c))

Answer 2

An easy solution would be to sort the characters alphabetically and compare them to one another.

public static class AnagramExtensions
{
    public static bool IsAnagramOf(this string word1, string word2)
    {
        return word1.OrderBy(x => x).SequenceEqual(word2.OrderBy(x => x));
    }
}

Then, to use it:

    static void Main()
    {
        string word1 = "cat";
        string word2 = "tac";

        Console.WriteLine(word1.IsAnagramOf(word2));

        string word3 = "cat";
        string word4 = "dog";

        Console.WriteLine(word3.IsAnagramOf(word4));
    }   

The output in this case would be

True

False