摘要
在简要讨论简单算法和复杂算法通常所采用的传统的时间复杂度衡量方法的基础上,提出了一种基于分析法的时间复杂度衡量方法。该方法借助于分析二叉树特性,根据二叉树的特点分析算法中核心操作语句频度,与传统的方法相比,更简单,效率更高。
Based on briefly discussing the traditional time complexity measure method usually used in simple algorithm and complex algorithm, a method based on analysis method is proposed. compared with the traditional method, the method is more simple and efficient by analyzing the characteristics of the binary tree and analyzing core operating frequency in the algorithm according to binary tree features.
出处
《辽宁工业大学学报（自然科学版）》
2015年第4期231-233,239,共4页
Journal of Liaoning University of Technology(Natural Science Edition)
基金
辽宁省博士启动基金计划项目(20121045)
关键词
时间复杂度
二叉树
折半查找
归并排序
分治法
time complexity
binary tree
binary search
merging sort
dividing and conqueringmethod
