The Bell numbers count the number of partitions of a set. I want to generate all possible partitions of my integer array.
For example, I have the following integer array: {1, 2, 3, 4}. Then there are 15 partitions.
Is there any simple way to complete my task? Or what is common algorithm?