| 算法的时间复杂性的讨论 |
| |
| 引用本文： | 林季伦. 算法的时间复杂性的讨论[J]. 天津理工大学学报, 1996, 0(3) |
| |
| 作者姓名： | 林季伦 |
| |
| 作者单位： | 天津理工学院计算机系 |
| |
| 摘 要： | 本文按程序的结构分类确定时间的数量级．当找到算法对应的程序时，便得出算法的时间复杂性．这是解决在最坏情况复杂性的一般性问题的新方法．
|
| 关 键 词： | 时间复杂性，最坏情况复杂性 |
THA DISCUSSION ABOUT THE TIMECOMPLEXITY ON THE ALGORITHM |
| |
| Lin Jilun. THA DISCUSSION ABOUT THE TIMECOMPLEXITY ON THE ALGORITHM[J]. Journal of Tianjin University of Technology, 1996, 0(3) |
| |
| Authors: | Lin Jilun |
| |
| Abstract: | L:Classified according to program stucture, the quantity grade of time is determined. The result in the time complexity of the Algorithm is obtained when the algorithmscorresponding the programs are found out. It is a new method to solve common question inthe worst case complexity. |
| |
| Keywords: | ime complexity worst case complexity |
| 本文献已被 CNKI 等数据库收录！ |
