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...
| Published in: | SHS Web of Conferences |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2022-01-01
|
| Online Access: | https://www.shs-conferences.org/articles/shsconf/pdf/2022/14/shsconf_stehf2022_03009.pdf |