《算法导论》2、选择排序实现（C++）

#include <iostream>
using namespace std;
void main()
{
int a[] = { 31, 41, 59, 26, 41, 58 };
for (int i = 0; i < 5; i++)
{
int minindex = i;
int min = a[i];
for (int j = i; j < 6; j++)
{
if (a[j] < min)
{
min = a[j];
minindex = j;
}
}
int temp = 0;
temp = a[i];
a[i] = min;
a[minindex] = temp;
}
for (int i = 0; i < 6; i++)
{
cout << a[i] << "  ";
cout << endl;
}
system("pause");
}