Generates all the possible permutations of the items in collection. If collection has N items, then N factorial permutations will be generated. This method does not compare the items to determine if any of them are equal. If some items are equal, the same permutation may be generated more than once. For example, if the collections contains the three items A, A, and B, then this method will generate the six permutations, AAB, AAB, ABA, ABA, BAA, BAA (not necessarily in that order). To take equal items into account, use the GenerateSortedPermutations method.

public static IEnumerable<T[]> GeneratePermutations<T>(
	IEnumerable<T> collection
)

public:
generic<typename T>
static IEnumerable<array<T>^>^ GeneratePermutations(
	IEnumerable<T>^ collection
)