public class OrderedKPartitionGenerator
This is a k-partition generator. However, this generates partitions where every element is at least one. For
instance, n = 12 and k = 5 will NOT create the partition [12, 0, 0, 0, 0]. It will start with the partition [8, 1, 1, 1,
1]. It requires that k=n, the results are unpredictable. I believe this is the most efficient algorithm for
what we want.