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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SHS web of conferences Jg. 144; S. 3009
1. Verfasser:	Chen, Xiaoxi
Format:	Journal Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Les Ulis EDP Sciences 2022
Schlagworte:	Algorithms Application Computer science Efficiency Property Research applications Simplicity
ISSN:	2261-2424, 2416-5182, 2261-2424
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!