That one's not so obvious. So let's think about this for a second. To sort a list in linear time, would say, I have to look at each element in the list at most a constant number of times.

所以让我们来思考一会,要在线性时间能排序，列表里每个元素最多被使用常数次,不一定是一次，对吧。

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

It's as though I've walked across the stage like this realized, damn, it was the guy over here or rather I found the smallest element here who beat out number 2 over here so I can now put number 1 into place and recall that it didn't matte if I punted whoever was standing here 'cause they were given to me randomly anyway.

这就像是我这样走过讲台,然后才发现要找的人在那儿,或者说发现了最小的元素,那么就可以将1号放在正确的位置,而在这儿的是谁并不重要,因为他们本身就是,随机的。

哈佛公开课 - 计算机科学课程节选