An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1

coin problem | complete sequence | Egyptian fraction | Frobenius equation | Frobenius number | integer relation | knapsack problem | Levine-O'Sullivan greedy algorithm | McNugget number | reverse greedy algorithm | square number | subset sum problem | Sylvester's sequence