I'm lookng for all partitions of a set. For set that contains 12 number it's ok, but for 13 I'm getting out of memory exception. I'm sure of my algorithm. It gives me good result and good number of subsets. For 1, 2, 3... 12.. and then i try to get a 13 and there's a problem.
That's how many is them: WOLPHRAM STRILING
Is there any way to increase memory? Or at least write a method that will gives me with keyword out dynamicly alocated number of parameters?
I'm using the code from the second post: Code of partitioning