The Application of Greedy Algorithm in Real Life

Abstract

Greedy algorithm, also known as voracity algorithm, and is simple and easy to adapt to the local area of the optimization strategy. In other words, every time it makes the choice is the best choice in the current. It is not considered from the point of view of the overall optimization to consider, but every time the choice is only in a sense of the local optimal choice. So, for a problem, we should consider whether it can use the greedy algorithm strategy, and whether the solution we find is the optimal solution. It is not an overall optimal solution to any problem, but most of the problems with a wide range of problems can be solved by the global optimal solution or the similar solution of the global optimal solution. With the arrival of the era of big data, a large number of data information needs to be processed in a timely manner, In order to meet the needs of people to deal with a large number of data information, and to solve various practical problems in a timely manner, computer algorithm got the rapid development, A large number of operations research models have been applied to the computer algorithm, which has produced many effective algorithms to solve practical problems. Greedy algorithm in solving the problem, it is from the initial stage, in each stage is to make a local optimal greedy choice. Each time the greedy choice transforms the original problem into a sub problem of the same form as the original problem. Greedy algorithm has no fixed algorithm framework, the key of the design algorithm is the choice and determination of greedy strategy.