幼稚的声明翻译会导致执行算法时间复杂度高。
Naive translation of declarations leads to executable algorithms with high time complexity.
给出该求解方法的聚类算法描述及算法时间复杂度分析。
It gives the algorithm based on the proposed method and the time complexity analysis.
通过递归实例,介绍了递归算法时间复杂度的一类分析方法。
Using real example of recursion, we introduce a type of analysis method of recursion algorism's time complexity.
Therefore, for simple branching programs, the length of time, the complexity the code, is what we would call constant.
因此,对于简单的分支程序,运行的时间长度,算法的复杂度,也就是我们说的常数。
The message I'm trying to get to here, because I'm running you right up against time, is I have to be careful about what's a primitive step.
我想说的事情是,因为我正在跟大家讲算法时间复杂度,我们需要注意一个基本步骤的定义,如果我可以假设。
I ask you for the running time of this algorithm and you give me the running time in terms of the running time, right.
我需要得到此算法的时间复杂度,那就明确地给出其,运行时间。
应用推荐