Greedy algorithms build up a solution piece by piece, always choosing the next piece that offers the most immediate benefit. They are used in optimization problems where local choices lead to a global optimum.
