· A heuristic, however, is a method that:

(1) might not always find the best

(2) but is guaranteed to find a good

solution in reasonable time

By sacrificing completeness it increases efficiency

Useful in solving tough problems which

(1) could not be solved any other way

(2) solutions take an infinite time or very long

time to compute

Thus, greedy algorithm is also a heuristic algorithm