选择排序

 

代码如下：

 

#include<iostream>

using namespace std;

void select_sort(int *arr, int n)
{
	int i, j;
	int max;
	for (i = 0; i < n - 1; i++)
	{
		max = i;
		for (j = max + 1; j < n; j++)
		{
			if (arr[max] > arr[j])
			{
				max = j;
			}
		}
		if (max != i)
		{
			int T = arr[i];
			arr[i] = arr[max];
			arr[max] = T;
		}
	}

}

void main()
{
	int arr[] = { 3, 5, 7, 2, 6, 9, 8, 4, 1, 10 };
	for (int i = 0; i < sizeof(arr) / sizeof(int); i++)
		cout << arr[i] << " ";
	cout << endl;

	select_sort(arr, sizeof(arr) / sizeof(int));
	for (int i = 0; i < sizeof(arr) / sizeof(int); i++)
		cout << arr[i] << " ";
	cout << endl;

	system("pause");
}