What is the fastest algorithm for generating set partitions?

For a set of n elements, say S_n = {1,2,...,n}, a set partition is a set P = {s_1,s_2,...,s_k} of nonempty subsets s_i of S_n whose intersection is empty and whose union equals S_n.

11 November 2012 1,350 7 View