Anyone know of a simple algorithm to systematically enumerate all the partitions of a set? (Ie all ways in which a set can be exhaustively partitioned into subsets)? Here for eg is me merely trying to count all the partitions of a set of 7. Probably some mistakes here.
Conversation
You’re unable to view this Tweet because this account owner limits who can view their Tweets. Learn more
Replying to
Yes, but an algo for actually using the stirling and bell number formulas to list out all partitions
