排序算法-选择排序

#include <iostream>
using namespace std;

void Csort(int a[], int n)
{
	int max_data = a[0];
	int max_index = 0;
	for (int i = 0; i < n-1; ++i)
	{
		int j = 0;
		for (; j < n - i; ++j)
		{
			if (a[j]>max_data)
			{
				max_data = a[j];
				max_index = j;
			}
		}
		int temp = a[max_index];
		a[max_index] = a[n - i - 1];
		a[n - i - 1] = temp;
		max_data = a[0];
		max_index = 0;
	}
}

void main()
{
	int a[] = {2,6,12,1,8,7,2,3,7,5,4,5};
	Csort(a,12);
	for (int i = 0; i < 12; ++i)
	{
		cout << a[i] << endl;
	}
}