Just contrast this for a brief moment to something like Selection Sort which from the get go had a ridiculous amount of redundancy comparing the same damn numbers again and again, and again.

这就与其他的排序算法形成了鲜明的对比,比如选择排序,它会一次又一次地做,多余的比较。

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

So strings also support things like selection, slicing, and a set of other parameters, other properties. And let's just look at that.

如果我要到这里来的话，就得把这儿注释掉，这里是我已经建立的。

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

And this was just a formal way of describing the best case running time and in the case of Selection Sort, what was the best case running time?

这是描述最好情况下运行时间的,一种正式的方式,在选择排序中，最理想的运行时间是多少呢？

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