摘要
算法的时间复杂度是反映算法优劣的重要指标,是《数据结构》的重要理论基础,是学习和教学过程中贯穿始终的主要线索。但是由于概念的抽象和计算方法的繁琐,使算法时间复杂度成为最难理解和掌握的问题之一。在总结教学经验的基础上,该文提出几种常用的时间复杂度计算方法,使对该知识点的教学和学习变得系统和简单。
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.
作者
刘怀愚
朱昌杰
李璟
LIU Huai-yu, ZHU Chang-fie, LI Jing (Schoof of Computer Science and Technology, Huaibei Normal University, Huaibei 235000, China)
出处
《电脑知识与技术》
2011年第7期4636-4638,共3页
Computer Knowledge and Technology
关键词
数据结构
时间复杂度
渐进时间复杂度
迭代法
Datastructure
Time Complexity
Asymptotic Time Complexity
Iteration method