时间复杂度的几种计算方法.pdfVIP

ISSN 1009-3044 E-mail: eduf@ 第 卷第 期 年 月 Computer Knowledge and Technology 电脑知识与技术 7 19 (2011 7 ) Computer Knowledge and Technology 电脑知识与技术 Vol.7, No.19, July 2011. Tel:+86-551-5690963 5690964 时间复杂度的几种计算方法 刘怀愚，朱昌杰，李璟 （淮北师范大学计算机科学与技术学院，安徽淮北 235000 ） 摘要：算法的时间复杂度是反映算法优劣的重要指标，是《数据结构》 的重要理论基础，是学习和教学过程中贯穿始终的主要线索。 但是由于概念的抽象和计算方法的繁琐，使算法时间复杂度成为最难理解和掌握的问题之一。 在总结教学经验的基础上，该文提出 几种常用的时间复杂度计算方法，使对该知识点的教学和学习变得系统和简单。 关键词：数据结构；时间复杂度；渐进时间复杂度；迭代法 中图分类号： 文献标识码： 文章编号： TP301 A 1009-3044(2011)19-4636-03 Several Calculation Methods of Time Complexity LIU Huai-yu, ZHU Chang-jie, LI Jing (Schoof of Computer Science and Technology, Huaibei Normal University, Huaibei 235000, China) Abstract: Time complexity is an important index in algorithm in terms of reflecting the quality of the algorithm. Time complexity is also an important theoretical basis in Data Structure, thus is regarded as a major clue throughout learning and teaching process. However, due to the abstractness of the concept and the tedious calculation method, time complexity of the algorithm becomes a most difficult issue to un- derstand and master. This paper, on the basis of summing up teaching experiences, presents several commonly used methods for the time complexity with the aim of simplifying the teaching and learning of the knowledge point in a systematic approach. Key words: Datastructure; Time Complexity; Asymptotic Time Complexity; Iteration method 1 算法时间复杂度的基本概念 1.1 算法的执行时间和语句频度 在已证明算法正确性的前提下，评价算法的好坏主要是关注算法在时间和空间上性能的优劣。