选择排序
void selectionSort1(vector<int> arr)
{
int minIndex;
for (int i = 0; i < arr.size() - 1; i++) {
minIndex = i;
for (int j = i + 1; j < arr.size(); j++) {
if (arr[minIndex] > arr[j]) {
minIndex = j;
}
}
int temp = arr[i];
arr[i] = arr[minIndex];
arr[minIndex] = temp;
}
}
二元选择排序
void selectionSort2(vector<int> arr)
{
int minIndex, maxIndex;
for (int i = 0; i < arr.size() / 2; i++) {
minIndex = i;
maxIndex = i;
for (int j = i + 1; j < arr.size() - i; j++) {
if (arr[minIndex] > arr[j]) {
minIndex = j;
}
if (arr[maxIndex] < arr[j]) {
maxIndex = j;
}
}
if (minIndex == maxIndex) break;
int temp = arr[i];
arr[i] = arr[minIndex];
arr[minIndex] = temp;
if (maxIndex == i) maxIndex = minIndex;
int lastIndex = arr.size() - 1 - i;
temp = arr[lastIndex];
arr[lastIndex] = arr[maxIndex];
arr[maxIndex] = temp;
}
}