全部

1·This is in contrast to selection sort where you're fishing looking again and again for the smallest element.

这与选择排序形成了对比，在选择排序中，你一次又一次地完成寻找最小的元素。

2·How many swaps do I do in selection sort?

那选择排序要做多少次交换呢？

3·The example program for this section implements a selection sort on an array of integers.

本节的示例程序在一个整数数组上实现选择排序。

4·We looked at something called Selection Sort and that too was pretty straightforward, at least conceptually.

例如选择排序，至少从概念上来说，它非常简单。

5·When you sort an array using selection sort, you choose the smallest element in the rest of the array on each cycle of the loop.

当你对数组使用选择排序，你选择最小的元素，其余的阵列每一个周期的循环。

6·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?

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

7·This paper introduces two mature sorting methods: bubble sort and selection sort, and points out that these sorting methods could be used to realize the two-direction sort.

介绍了两种较为成熟的排序方法冒泡法和选择排序法，指出这两种排序方法都可在原来基础上实现双向排序。

8·So Selection Sort, while it might be easier perhaps to think through than Bubble Sort, or maybe it's pretty much equivalent, it's just a different approach to the same problem.

因此，仔细想想，选择排序也许比，冒泡排序更简单，或者这两者都差不多，只是对同一问题的不同方法而已。

9·Sometimes the user may want to sort the data only on one of the available selection criteria and leave the others blank or select no criteria to sort the data by leaving all the criteria blank.

有时候，用户可能希望只根据一个可用的选择条件对数据排序，而将其他条件留空，或者不选择任何条件，将所有条件留空。

10·How many swaps do I do in general in bubble sort, compared to selection source?

在冒泡排序中，一般要做多少次交换，对比选择排序呢？