The unsorted, and you have exactly the point I want to get to-- how come all the guys, sorry, all the people answering questions are way, way up in the back? Wow. that's a Tim Wakefield pitch right there, all right. Thank you.

所有的同学，抱歉,所有的人们都是这么回答的，扔到后面，哇，这是一个Tim，Wakefield式的投掷啊，谢谢！,他完全正确，不是么？这比这小么？

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

In the linear case, meaning in the unsorted case what's the complexity of this? k times n, right? Order n to do the search, and I've got to do it k times, so this would be k times n.

复杂度是多少？k的n次方，对吧？,在序列n中做搜索，要做k次，所以是k的n次方次,如果先排序后搜索。

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