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.
本节的示例程序在一个整数数组上实现选择排序。
Let's do selection and let's do merge sort here on the right just to see what actually happens.
中间进行选择排序,右边进行归并排序,看看会发生什么。
And this is in contrast to Selection Sort where you're fishing again and again for the then smallest element.
这与选择排序是相反的,在选择排序中你需要一次又一次地,找出最小的元素。
How many swaps do I do in general in bubble sort, compared to selection source?
在冒泡排序中,一般要做多少次交换,对比选择排序呢?
应用推荐