| 基于二分排序法时间复杂度的求解过程 |
| |
| 引用本文： | 饶正婵,范林柏.基于二分排序法时间复杂度的求解过程[J].铜仁学院学报,2011,13(3):139-141. |
| |
| 作者姓名： | 饶正婵 范林柏 |
| |
| 作者单位： | 1. 铜仁学院计算机科学系,贵州铜仁,554300
2. 湖南大学软件学院,湖南长沙,410006 |
| |
| 摘 要： | 对算法设计的效果进行全面分析是每一个软件项目管理中具体算法设计时所要考虑的问题之一。对算法作时间及空间复杂度的度量，是一项重要的工作。对二分查找排序法的时间复杂度的求解过程进行全面分析，得到时间复杂度的求解方法，这对于掌握算法的设计有大的帮助。
|
| 关 键 词： | 算法 时间复杂度 二分查找 度量 |
The Solution Process of Time Complexity Based on Dichotomy Sorting Method |
| |
| RAO Zheng-chan,FAN Lin-bai.The Solution Process of Time Complexity Based on Dichotomy Sorting Method[J].Journal of Tongren University,2011,13(3):139-141. |
| |
| Authors: | RAO Zheng-chan FAN Lin-bai |
| |
| Institution: | RAO Zheng-chan1,2,FAN Lin-bai2(1.Department of Mathematics and Computer Science,Tongren University,Tongren,Guizhou 554300,China,2.Software School,Hunan University,Changsha,Hunan 410006,China) |
| |
| Abstract: | The comprehensive analysis of algorithm design effect is one of the problems to be considered in each project management. The measurement about time and space complexity of algorithm is an important task. This paper comprehensively analyzes the solution process of time complexity based on dichotomy sorting method and obtains its solution. It is a big help for the grasp of algorithm design. |
| |
| Keywords: | algorithm time complexity binary search measurement |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
