Code interview of Amazon

Given a sorted integer array, and a target. Find all combinations that add up to the target number. Implement the algorithm.

e,g, [1,2,3,4,5,6] and target number: 12

Output: (1,5,6) (2,4,6) (3,4,5) (1,2,3,4) etc.

Remark: it is a knapsack problem.