Thanks Michael,
I appreciate the information. Because I'm trying to learn Go, I'm more
interested in what should cause it to stop running part way through the
process without generating an error. It just seems bizarre to me but I'm
sure it'll reveal an error in my thinking.
--
You receive
Generating set partitions is efficiently performed by [the second]
Algorithm H in Knuth's Art of Computer Programming, Volume 4A,
Combinatorial Algorithms, Part 1. It appears on page 416.
Counting the number of set partitions means evaluating the Bell numbers,
which is easily done by table summati
On Thu, Oct 12, 2017 at 11:57 PM, john lynch wrote:
>
> I've been implementing some Python code in Go to learn the language. In
> Python this will generate a Set Partition. The Go equivalent follows.
>
> The Go runs fine for list element sizes 2 and 3 (which means the recursion
> is running prop
I've been implementing some Python code in Go to learn the language. In
Python this will generate a Set Partition. The Go equivalent follows.
The Go runs fine for list element sizes 2 and 3 (which means the recursion
is running properly). Also 4 but at 5 and above it generates the intial
sets
