Greedy algorithm: Builds up a solution piece by piece, always choose a local optimal solution (the way with the best result in current round), in the hope of leading to a global optimization.
Description
One of classic problems of combination/permutation. Combination means the sequence of elements in subset does not matter but which elments to include matter. Essentially, these type of problems falls into DFS genre.