So don't get too caught up in understanding the methods or statistics in a particular study or anything like that.

所以没必要过于纠结,非要去理解,某项研究的分析和算法

耶鲁公开课 - 关于食物的心理学、生物学和政治学课程节选

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

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