Two Algorithms for Weight Problems
- 10.2991/icemc-16.2016.228How to use a DOI?
- Weight problem; Greedy algorithm; Dynamic programming; C++;
Research on weight problem is helpful to solve other problems, and it has practical significance for the design of the algorithm and the solution of the real life. The purpose of this paper is to introduce the solution for the weight problem with both greedy algorithm and dynamic programming. We mainly discuss the difference between these two algorithms based on different solution methods. The algorithms in this paper are described in C language, natural language or charts.
- © 2016, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Chun Shi AU - Xin Yin AU - Chunyu Li AU - Ruyin Xu AU - Shuqian He PY - 2016/05 DA - 2016/05 TI - Two Algorithms for Weight Problems BT - Proceedings of the 2016 International Conference on Education, Management and Computer Science PB - Atlantis Press SP - 1182 EP - 1186 SN - 1951-6851 UR - https://doi.org/10.2991/icemc-16.2016.228 DO - 10.2991/icemc-16.2016.228 ID - Shi2016/05 ER -