This is in contrast to selection sort where you're fishing looking again and again for the smallest element.
这与选择排序形成了对比,在选择排序中,你一次又一次地完成寻找最小的元素。
How many swaps do I do in selection sort?
那选择排序要做多少次交换呢?
The example program for this section implements a selection sort on an array of integers.
本节的示例程序在一个整数数组上实现选择排序。
And this is in contrast to Selection Sort where you're fishing again and again for the then smallest element.
这与选择排序是相反的,在选择排序中你需要一次又一次地,找出最小的元素。
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.
这就与其他的排序算法形成了鲜明的对比,比如选择排序,它会一次又一次地做,多余的比较。
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?
这是描述最好情况下运行时间的,一种正式的方式,在选择排序中,最理想的运行时间是多少呢?
应用推荐