My first post in the forum.
In how many ways can n number of coins be split into piles?
This is equivalent to find the integer partitions of n
So I opened Wikipedia and found a recursive approach to solving this.
But in Python The maximum recursion depth I have is only 900.
The Program generates a runtime error when I try to go for a larger number than 900.
Would you please suggest a better way to solve partition problems?
Yes, there are a lot in the wikipedia but I don't understand them
Please explain
