文件名称:Finding_Maximum
- 所属分类：
- JSP源码/Java
- 资源属性：
- [PDF]
- 上传时间：
- 2012-11-26
- 文件大小：
- 30kb
- 下载次数：
- 0次
- 提 供 者：
- yul***
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
Finding Maximum Contiguous Subsequence Sum using divide-and-conquer
approach-Given a sequence Q of n numbers (positive and negative), the maximum subsequence of Q is the
contiguous subsequence that has the maximum sum among all contiguous subsequences of Q.
approach-Given a sequence Q of n numbers (positive and negative), the maximum subsequence of Q is the
contiguous subsequence that has the maximum sum among all contiguous subsequences of Q.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Finding_Maximum.pdf