c++实现的选择排序算法
#include <iostream>
using namespace std;
int main()
{
int a[] = {3, 5, 9, 4, 1, 10, 2, 6, 13, 8, 15, 12};
int minnum ;
int length = sizeof(a) / sizeof(int);
for(int i=0; i < length; i++ )
{
minnum = a[i];
for(int j = i+1; j < length; j++)
{
if (a[j] < minnum)
{
minnum = a[j];
a[j] = a[i];
a[i] = minnum;
}
}
}
for(int i = 0; i < length; i++)
cout << a[i] << endl;
}