| 内分类算法复杂性的讨论 |
| |
| 引用本文： | 冯德民.内分类算法复杂性的讨论[J].陕西师范大学学报,1990(2). |
| |
| 作者姓名： | 冯德民 |
| |
| 作者单位： | 陕西师范大学计算机科学系 |
| |
| 摘 要： | 在一定的条件下,给出内分类算法复杂性的严格定义;通过一种新的内分类算法分析及其与古典的内分类算法的测试比较,说明这一定义的合理性。最后给出了这种新算法的改进框图。
|
| 关 键 词： | 算法分析 内分类 算法复杂性 shell分类 汽泡分类 插入分类 |
Discussion about Algorithm Complexity of the Internal Sorting |
| |
| Feng Demin.Discussion about Algorithm Complexity of the Internal Sorting[J].Journal of Shaanxi Normal University: Nat Sci Ed,1990(2). |
| |
| Authors: | Feng Demin |
| |
| Institution: | Department of Computer Science |
| |
| Abstract: | Some rigid definitions about the algorithm complexity of the internal sorting under certain conditions is given. These definitions are justified by an analysis with the new internal sorting and the testing and comparing between the new internal sorting and the classical internal sorting. The block diagram of the improvement of the method is geven. |
| |
| Keywords: | algorithm analysis internal sorting algorthm complexity shell sorting bubble sorting inserting sorting |
| 本文献已被 CNKI 等数据库收录！ |
