A Comparison of Greedy Algorithm and Dynamic Programming Algorithm

Two algorithms to handle the problem include greedy algorithms and dynamic programming. Because of their simplicity, intuitiveness, and great efficiency in addressing problems, they are frequently employed in a variety of circumstances. The connection and difference of the two algorithms are compare...

Full description

Saved in:
Bibliographic Details
Published in:SHS web of conferences Vol. 144; p. 3009
Main Author: Chen, Xiaoxi
Format: Journal Article Conference Proceeding
Language:English
Published: Les Ulis EDP Sciences 2022
Subjects:
Algorithms
Application
Computer science
Efficiency
Property
Research applications
Simplicity
ISSN:2261-2424, 2416-5182, 2261-2424
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Two algorithms to handle the problem include greedy algorithms and dynamic programming. Because of their simplicity, intuitiveness, and great efficiency in addressing problems, they are frequently employed in a variety of circumstances. The connection and difference of the two algorithms are compared by introducing the essential ideas of the two algorithms. The knapsack problem is a classic problem in computer science. In the application of solving the backpack problem, greedy algorithm is faster, but the resulting solution is not always optimal; dynamic programming results in an optimal solution, but the solving speed is slower. The research compares the application properties and application scope of the two strategies, with the greedy approach being the better approach in solving the knapsack problem.
Bibliography:ObjectType-Conference Proceeding-1
SourceType-Conference Papers & Proceedings-1
content type line 21
ISSN:2261-2424
2416-5182
2261-2424
DOI:10.1051/shsconf/202214403009