不要为了使代码更快而胡乱编写代码——要找到更好的算法。

Don't diddle code to make it faster—find a better algorithm.

youdao

最后得到的一组适用权限的算法是要计算所有权限的交集。

The basic algorithm for arriving at the final, applicable set of permissions is to compute the intersection of all Pis.

youdao

也就是说，你设计的算法要利用DalvikVM中所有的处理器资源，而且原生运行较为有利。

That is, you have algorithms that are using all of the processor within the DalvikVM and would benefit from running natively.

youdao

And the obvious question I could start with is, and suppose I ask you, how long does the algorithm implemented by this program take to run?

我开始这个话题的第一个问题是，假设我问你，由这个算法实现的程序大概,要运行多久才能给出答案？

麻省理工公开课 - 计算机科学及编程导论课程节选

It implies that this algorithm is calling itself again and again, and again, and on each time the size of the problem I'm trying to sort is being divided by what?

这就说明此算法会一次又一次地调用自己,每次我要排序的问题规模大小,会除以多少呢？

哈佛公开课 - 计算机科学课程节选

So this is a nice little search-- sorry, a nice little sort algorithm . And in fact, it's relying on something that we're going to come back to, called the loop invariant.

恩，这是一个很棒的小搜索，抱歉，和很棒的小排序算法，事实上，它依赖于一些我们要回顾的东西,被称作循环不变量。

麻省理工公开课 - 计算机科学及编程导论课程节选