Is there an efficient algorithm for integer partitioning with restricted number of parts?

Question

I have to create a method that takes two integers, let them be n and m, and returns how many ways there are to sum m positive numbers

Answer 1

this problem seems to be SubSet Sum Problem

its an NP problem meaning all the solutions would be non-deterministic (i.e. there isn't any known efficient algorithm).

you can however try some heuristic approach and find some satisfying results in a more efficient way.