Greedy algorithm

A greedy algorithm is a way of solving a problem where you make the best choice at each step. For example, if you are given a bag of candy and you want to get the most candy, a greedy algorithm would help you do that. You would look at the candy in the bag, pick the one with the most pieces, and then keep doing that until you've eaten all the candy.