What's the complexity of this algorithm?
这个算法的复杂度又是多少呢？
Clearly, this algorithm runs in o (mn) time.
显然，这个算法的运行时间为O (mn)。
The KerberosKey class implements this algorithm.
KerberosKey类实现了这种算法。
Well how many more steps does this algorithm take?
用同样的算法需要多几个步骤？
The correctness of this algorithm is intuitively clear.
这种算法的正确性是很显然的。
It is found that the tracking range of this algorithm is not fixed.
发现这种算法的跟踪范围不是固定不变的。
Of course, this algorithm probably raises more questions than it answers.
当然，与这个算法解决的问题相比，它导致的新问题可能更多。
Through this algorithm, the file compression can achieve very good results.
通过这个算法，能对文件压缩达到很好的效果。
Several Google engineers have posted publicly that they're working on this algorithm.
一些Google的工程师已经公开承认他们目前正在努力完成这一算法。
If the dataset has duplicates, this algorithm automatically falls back to random mode.
如果是有重复的数据集，该算法就会自动转到随机模式。
In this algorithm, the order in which buffers get processed is much less deterministic.
在这个算法中，处理缓冲区的次序是很不确定的。
Implementing and executing this algorithm using our libraries produced the following results.
使用我们的库来实现并执行这个算法产生以下结果。
It's easy to see that this algorithm always works if the maze you're in has an entrance and an exit on its border.
很容易看出，如果迷宫的边界上有一个入口和一个出口，那么这种算法总是有效的。
I was hoping to implement this algorithm completely in this column, but I have had to invest some time in learning JUnit.
我希望在这篇专栏文章中完整地实现该算法，但我必须花一些时间来了解JUnit。
The constraint of this algorithm is that a local element is not allowed to be declared with the same name of a global element.
这个算法的限制是局部元素不能声明为与全局元素同名。
One downside to this algorithm is that it requires more math with big numbers, and thus is a little more computationally taxing on a busy server.
这个算法的缺点是需要计算更大的数字，所以对于一个很忙的服务器来说计算成本更大。
Although at this time I have not yet worked out all the details for this algorithm, I plan to use transition diagrams, such as the one in Figure 2.
尽管此时我还没有得出这种算法的所有详细信息，但我打算使用转换图，譬如图2中的转换图。
So the number of users and groups is limited to less than 65,000 across the enterprise, and the possibility of duplicates does exist with this algorithm.
所以，整个企业内用户和组的数目必须小于65,000，并且采用这个算法可能会出现重复的值。
In fact, if you were to trace this algorithm, you would realize that it builds a list of all the possible stack configurations and the transitions between them.
事实上，如果跟踪该算法的过程，就会认识到它构建一个所有可能的堆栈配置以及在这些配置间的转换的列表。
Now, let's think about how you might apply this algorithm to your current uppercase-conversion code. For reference, here is the original code in convert_driver_c.c
现在，我们考虑一下如何将这个算法应用于当前的大写转换代码。
The simulation results indicate that this algorithm not only guarantees global convergence, but also improves the converging rate and the stability effectively.
仿真结果表明，该算法不仅保证了全局收敛性，而且大大提高了算法的收敛速度和稳定性。
All you do to solve a maze using this algorithm is keep your left hand on the left wall (or your right hand on the right wall) and just follow it along until you exit the maze.
在用这种算法解迷宫时，只需要把左手一直放在左边的墙上(或者把右手一直放在右边的墙上)，然后沿着墙走，直到走出迷宫。
This algorithm is not perfect and certain edge cases exist.
这个算法并不是很完美，并存在某些边缘情况。
This algorithm type is quite common in search databases and other reference applications.
在搜索数据库和其他参考应用程序里，这种算法类型相当普遍。
This algorithm can take into account different capacities for different endpoints in a group.
这个算法能够考虑到组中不同端点的接受能力。
This algorithm repeats recursively until all newly resolved subgroups have no further subgroups.
此算法递归地重复，直到所有新解析的子组不再包含子组。
This algorithm repeats recursively until all newly resolved subgroups contain no further subgroups.
此算法递归地重复，直到所有新解析的子组不再包含子组。
This algorithm style will produce a tree whose leaves are defined by tasks that take the THEN branch.
该风格的算法将生成一棵树，其中树叶由采用THEN分支的任务定义。
This algorithm tends to be memory efficient (allocating what's necessary) but requires more time to manage the heap.
这种算法通常具有较高的内存使用效率(分配需要的内存)，但是却需要花费更多时间来对堆进行管理。
应用推荐