I just go down the list selecting the smallest person at a time and then I repeat, repeat, repeat but when we actually did out the math or kind of reason through it, the running time, the asymptotic running time of bub-- of Selection Sort was also what?

只需要遍历列表，每次找出最小的元素,然后重复上述步骤，但从数学角度看,选择排序的时间复杂度,又是多少呢？

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

And I'll remind you, what I'm printing out there is first and last, with the range I'm looking over, and then just how many times the iteration called.

我要打印出来的是，每次的区间,也就是first和last指向的值，以及重复多少次了。

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