So when I do the analysis, I want to think about what am I doing here, am I capturing all the pieces of it? Here, the two variables that matter are what's the length of the list, and how many times I'm going to search it?

这里，要关注的,两个变量是列表,的长度以及我要搜索的次数,这种情况下，这个算法赢了？

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

That's going to be filled out and articulated at great length in the subsequent chapters when all the laws they have to obey are spelled out.

条款将在后面的章节中,详细，准确的填写,所有应当遵守的规定都将阐明。

耶鲁公开课 - 旧约导论课程节选

At each stage, no matter which branch, here or here, I take, I'm cutting down the length of the list that I'm searching in half. All right?

选的是这里还是那里,我总是把列表分成两半，对吧？,所以如果我处理一个长度为n的列表？

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

It's going to let j run over the length of the list all right, so it's going to start at some point to move down, and then it's going to let i run over range, that's just one smaller, and what's it doing there?

就在这里，会做什么呢？,我们让j遍历这个列表,好的，它要从某一定开始移动,然后让i也跑遍整个范围，就是比之要小一，会发生什么？

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