title: Partition of a set into K disjoint subsets with equal sum
body: <p>Given n ( n &lt;= 20) non-negative numbers. Is there / Can there be an algorithm with acceptable time complexity that determines whether the n numbers can be divided into K ( K &lt;= 10)  disjoint subsets, such that each subset has equal sum? </p>