详细介绍,在本博客的数据结构栏目里有,不过是java版
#include<iostream>
using namespace std;
void Select_Sort(int a[],int num)
{
for(int i=0;i<num-1;i++)
{
int x = i; //要选择的点的位置
for(int j = i+1;j<num;j++)
{
if(a[x] > a[j])
{
//说明j更小
x = j;
}
}
if(x != i)
{
int temp = a[i];
a[i] = a[x];
a[x] = temp;
}
}
}
void main()
{
int a[] = {57,68,59,52,72,28,96,33,24};
int count = sizeof(a) / sizeof(a[0]);
Select_Sort(a,count);
for(int i=0;i<count;i++)
{
cout<<a[i]<<" ";
}
cout<<endl;
}