Algorithms that try to find the immediate short-term solution are considered greedy. It makes the best local choice at a given stage:
Greedy Arguments can be used to prove the correctness and/or optimality of greedy algorithms
Press
to search
Algorithms that try to find the immediate short-term solution are considered greedy. It makes the best local choice at a given stage:
Greedy Arguments can be used to prove the correctness and/or optimality of greedy algorithms