A log algorithm typically is one where you cut the size of the problem down by some multiplicative factor.

对数级复杂度的算法就是指,通过一系列常量级步数的操作,可以将问题的规模。

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

It's a good sign that this is logarithmic, and I'm going to come back in a second to why logs are a great thing.

为什么对数级复杂度是个好事情，让我们再来看一个算法,噢，抱歉是让我们再来看两个算法。

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

Yeah. Is the last one there?

对数级复杂度的算法的优势对不对？

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

And as a consequence, it is log.

因此这是对数级复杂度的算法。

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

With this, if I can assume that accessing the i'th element of a list is constant, then you can't see that the rest of that analysis looks just like the log analysis I did before, and each step, no matter which branch I'm taking, I'm cutting the problem down in half.

读取数组中的第i个元素,是个常量时间的操作的话，我也就能像以前那样得到,这个算法是对数级复杂度的分析,并且每一步不管我选择哪个区间，我都可以把问题的规模缩小一半。

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