And so you have to go back to the drawing board and realize Bubble Sort or whatever it is you're using just isn't enough to snuff, I need to come up with something more clever.

因此，你必须重新开始,而且会意识到冒泡排序,或你正在使用的方法并不理想，我需要提出一种更好的方法。

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

God bless. Oh, sorry, that wasn't a sneeze, it was a two? How many swaps do I do in bubble sort? A lot. Right. Potentially a lot because I'm constantly doing that, that says I'm running that inner loop a whole bunch of times.

上帝保佑，哦，抱歉，我没说清楚，这是两个问题,在冒泡排序中要做多少次排序？许多，正确的,可能要做很多次，因为在持续的干,这就意味着它要做很多次内部循环。

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

Like what the heck have we been spending our time for-- our time on with Bubble Sort and with Selection Sort and in fact there's plenty of other N squared sorts that we're not even gonna bother looking at.

真见鬼，我们竟然在-,冒泡排序和选择排序上花时间,而事实上，还有很多我们根本都不想考虑的,复杂度为N平方的排序方法。

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

Insertion sort or bubble sort?

插入排序还是冒泡排序？

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