Asymptotic Time Complexity

The asymptotic time complexity and better space complexity of this method of insertion sort are better than original ones.

这种插入排序算法不论时间复杂度还是空间复杂度，相对原2-路插入排序算法都有较好的改善。

Besides, some main characters of matrix link multiplication about asymptotic time complexity, space complexity and so on are analysed in detail.

分析和总结了矩阵链乘有关时间复杂度和空间复杂度等重要性质。

Compared with the classical algorithm, this algorithm is simple, with close asymptotic time complexity ( O ( n+ e~ 2/ n)).

同经典算法相比，该算法简单，时间复杂度相近（O（n+e2/n））。

Third, the convergence and supremum of the algorithm were proved, and the asymptotic time complexity was analyzed;

并分析了该算法的收敛性及渐进时间复杂度；

A high efficiency algorithm on which asymptotic time complexity is O ( n) on loopy moving of array element is given in this paper, and some skills and techniques are provided with Pascal language.

给出一种时间复杂度为O（n）的一维数组循环移动的高效算法，并给出用PASCAL语言实现的方法及技巧。

Experiments show that the algorithm is of practical value and its asymptotic time complexity is O ( 1).

由于散列均匀，其渐近时间复杂度为O（1）。

This paper specifically demonstrates the discrete-marking principle, factors and the identified rule of self-adaptability discrete step criteria, and it also analyses the asymptotic time complexity and space complexity in auto-support generation algorithm based on discrete-marking method.

详细阐述了离散标识法的原理、影响因素、自适应性离散步长的确定准则，分析了离散标识法快速支撑生成技术的渐进时间复杂度和空间复杂度。