Greedy algorithms solve problems by making the locally optimal choice at each step — hoping it leads to a globally optimal solution.