So in this case, it just keeps chopping down from the back end, which kind of makes sense, all right? But in a fixed number, in fact, twenty-three calls, it gets down to the point of being able to say whether it's there.

所以在这个例子中,我们能理解他从后端开始排除元素，这，里事实上每次会确定的运行23次，找到最终的元素,我们来换个方向，对。

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

What's this thing doing? It's walking along the list looking for the smallest thing in the back end of the list, keeping track of where it came from and swapping it with that spot in the list. All right?

这是在做什么？是在遍历列表,找列表后端最小的元素,跟踪它从哪里来的,然后同当前点的元素交换，明白了么？

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