Description: Greedy algorithm (also known as the greedy algorithm) refers to when to problem solving, always seems to be made in the current best choice. That is, not be optimal from the viewpoint of the whole, he is only made in the local optimal in some sense. Greedy algorithm is not all problems can be overall optimal solution, but for a wide range of many of the problems that he could produce an overall optimal solution is the overall optimal solution or approximate solution.
To Search:
File list (Check if you may need any files):
GreedyDetection.cpp
GreedyDetection.h
Download