And what does that say? It says, let's assume I want to do k searches of a list. OK.

如果我们假定要在列表中做k次搜索,在线性的情况下，假定是一个未排序的情况。

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

I mean, J. K. Rowling, Lloyd Alexander, C. S. Lewis, whatever you like.

比如说，罗琳、亚历山大、路易斯，你喜欢的都行。

英语阅读：技巧 - SpeakingMax英语口语达人

The U.K. Had copied the U.S. Idea -I guess they copied -I don't know where the original -I think it's probably -is it U.K. Cpying the U.S. In this case?

英国效仿了美国的想法,我猜他们是效仿美国的,我也不知道谁先发明的,我认为可能是,存款保险是英国模仿美国

耶鲁公开课 - 金融市场课程节选

Here's the problem. How do I get to the nth- er, the k'th element in the list, in this case?

如何找到第n个元素呢-,在这里，如何找到第k个元素呢？

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

And if I pull it out one more level, 12k it's 12 plus 12 plus t of b over 8, 12 k because I'll have 12 of those to add up, plus t of b over 2 to the k.

总结一下也就是说，在k步以后，总步数应该是，那这种情况什么时候才能停止呢？,才能到达最基本的情况呢？

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