using C5;using System;public class Entry{	public static void Main(string [] args)	{		Console.WriteLine("Starting...");		Console.WriteLine("cat: {0}", String.Join(", ", GetCombinations("cat")));		Console.WriteLine("dmoonfire: {0}", String.Join(", ", GetCombinations("dmoonfire")));	}	public static string[] GetCombinations(string name)	{		// Create a hash set to keep a unique list. You can use this		// with generics or System.Collections, but I like C5.		HashSet<string> combinations = new HashSet<string>();		// Get the combinations of every letter		GetCombinations(combinations, "", name);		// Return the results		return combinations.ToArray();	}	private static void GetCombinations(HashSet<string> combinations, string prefix, string input)	{		// If we only have one letter, just add it and return		if (input.Length == 1)			combinations.Add(prefix + input);		// Otherwise, we go through the entire list and pull out one		// letter at a time, then recursively look through the rest		for (int i = 0; i < input.Length; i++)		{			// Build a new prefix with the new letter			string newPrefix = prefix + input;			// Pull out the stuff before and after it			string before = input.Substring(0, i);			string after = input.Substring(i + 1);			// Recursion is your friend			GetCombinations(combinations, newPrefix, before + after);		}	}}

Quote:Original post by jpetrie

Quote:
Now, I'm using C5 for a collection class

Totally offtopic, but C5 was awesome until they refused to fix their event serialization bugs. :( Still a really solid library other than that, though.