Let's assume, for sake of argument, the thing I'm looking for is bigger than this. In that case, I'm going to throw away all of this, I'm going to hit that bottom line of that code.

让我们假定不是，假定要找的元素,比这个大，在这样的情况下，这些都擦掉，我要运行到代码的最后一行。

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

And so you care-- you care about ultimately how much time is my algorithm gonna take to perform on that worst case running time.

因此你最终所关心的是,算法在最坏情况下需要多长的,运行时间。

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

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?

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

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

In general, when we wanna talk about running time, we just need a silly place holder, so we'll call it T for time.

一般情况下，当我们讨论运行时间时，需要一种表示方法，这里T表示时间。

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