二元选择排序

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

void TwoSelectSort(vector<int>& arr)
{
	int length = arr.size();
	for (int i = 0, k = length - 1; i <= k; ++i, --k)
	{
		int min = arr[i];
		int max = arr[i];
		int maxIndex = i;
		int minIndex = i;
		for (int j = i + 1; j <= k; ++j)
		{
			if (min > arr[j])
			{
				min = arr[j];
				minIndex = j;
				continue;
			}
			if (max < arr[j])
			{
				max = arr[j];
				maxIndex = j;
			}
		}
		
		int maxTemp = arr[maxIndex];
		int minTemp = arr[minIndex];
		arr[maxIndex] = arr[k];
		arr[minIndex] = arr[i];
		arr[k] = maxTemp;
		arr[i] = minTemp;
	
	}
}

int main()
{
	vector<int> arr = { 10, 1, 3, 5, 8, 7, 10, 0, 3, 7, 9, 4, 8 };
	TwoSelectSort(arr);
	for (int i = 0; i < arr.size(); ++i)
	{
		cout << arr[i] << '\t';
	}
	return 0;
}