计算的复杂性理论研究算法的时间复杂性和空间复杂性。
The computing complexity theory discusses the time complexity and the space complexity of the algorithms.
理论分析表明，该算法的时间复杂性接近于线性复杂度。
The theoretic analysis demonstrates that the time complexity of this algorithm is approximately linear.
此外还给出了若干个基于广义二叉链表的算法设计，并分析了算法的时间复杂性。
Furthermore, some algorithm of the GBLL is offered and their complexities of the time are analyzed.
应用推荐