分析和计算算法效率的便捷方法

Research on New Convenient Methods of Classifing to Solve Algorithmic Time Complexity

通过对典型算法时间效率特征的分析,将求解算法时间复杂度的复杂过程进行简化,提出按算法的不同结构特性,具体问题具体分析,采用不同的思路和策略分而治之求解.提倡将求解过程集中在时间复杂度增长率的计算上.归纳出频度统计法、频度估算法、频度未知数法、列举频度归纳法、频度期望值法、扩展递归迭代法、上下限猜测法等几种根据算法特性求解时间复杂度的方法.这些方法涵盖了大多类算法,无论是在软件设计,还是在教学实践中,都有广泛的实用价值.

The complex analytic procedure of algorithmatic time complexity is simplified via analysing the character of time efficiency about algorithm ,in which an idea is put forward to solve varied problem according to the character of all kinds of structure of algorithm by using different route and solution strategies. The notion of the paper insists that the programmer's attention should be focused on the most important point which is the increasing rate of algorithmic time complexity.Those deduced methods include Statisting Frequency Count, Estimating Frequency Count, Analysising Unknown Numerical Value Frequency Count, Illustrating and Deducing Frequency Count, Guessing the Range of Frequency Count, Expanding Recursive to Iterative Frequency Count,etc.Those methods emboding the most of algorithm can be widely applied to not only software engineering design but also computer science educational field.With the application of those efficient measures ,manpower and material resources will be economized greatly to some extent.