Greedy vs Dynamic Programming

When the input is unsorted When making the locally best choice at each step does not guarantee a globally optimal result When the problem has only one feasible solution Greedy algorithms always find the optimal solution