Thanks to the greedy property, the algorithm can construct a globally optimal solution by making the best local choice at each step.