| 浅析求解最大子段和问题的算法 |
| |
| 引用本文： | 袁佳乐.浅析求解最大子段和问题的算法[J].内蒙古环境科学,2009(3). |
| |
| 作者姓名： | 袁佳乐 |
| |
| 作者单位： | 西安文理学院计算机科学系 |
| |
| 摘 要： | 用计算机解决复杂的问题,往往把一个大的、复杂的问题根据其功能划分为不同的模块,每一个模块完成一独立的功能.如果每一个模块用计算机语言来实现,那么当所有模块都实现时,即为对复杂问题的解决.最大子段和问题就是一具有独立功能的小模块,在很多大的问题中都涉及到此问题,用不同的算法解决此问题,并分析其优劣.
|
| 关 键 词： | 最大子段和 算法模块 动态规划 |
Analysis of the Algorithm to the Question about the Max Sub-paragraph Sum |
| |
| YUAN Jia-le.Analysis of the Algorithm to the Question about the Max Sub-paragraph Sum[J].Inner Mongolia Environmental Protection,2009(3). |
| |
| Authors: | YUAN Jia-le |
| |
| Institution: | YUAN Jia-le (Department of Computer Science; Xi an University of Arts and Science; Xi an 710065; China); |
| |
| Abstract: | To solve a complex issue by using computer is to discompose it according to its function,with each module to complete one independent function.If each module is achieved by using computer language,the complex issue is solved,when all the modules are achieved.The question about the largest sub-paragraph sum is an independent small module,which is involved in lots of complex issues.In this paper,a different algorithm to solve this problem is analyzed,as well as its pros and cons. |
| |
| Keywords: | the largest sub-paragraph sum algorithm dynamic programming |
| 本文献已被 维普 等数据库收录！ |
|
