Greedy is an algorithmic instance that creates one-piece solutions, always choose the next part that offers the most obvious and instant benefits so the best local choices that lead to global solutions are suitable for greedy.

Consider the fraction knapsack problem for example. The best local strategy is to choose the item that has the highest value vs. weight ratio value. This strategy also leads to a worldwide optimal solution because we allow fractionation of an item.