The following is the C# implementation of the Fortran algorithm posted in the previous post for generating all possible partitions of a set of items. We consider the items to be unique although they may be the same item (that is Object.Equals returns...

Note that the following implementation is a faithful reproduction of the NEXEQU algorithm in the book Combinatorial Algorithms For Computers and Calculators by Nijenhuis & Wilf. However, the implementation given in the text has been updated to Fortran...

The following code shows the implementation of the all permutations generation algorithm that was discussed in the previous blog post in C#. /// <summary> /// An enumeration of all the permuations of a set of items. /// </summary>...

Note that the following implementation is a faithful reproduction of the NEXPER algorithm in the book Combinatorial Algorithms For Computers and Calculators by Nijenhuis & Wilf. However, the implementation given in the text has been updated to Fortran...