选择法排序

#include<iostream>
using namespace std;
int main()
{
int i,j,a[11],min,temp;


cout<<"enter data:"<<endl;
for(i=1;i<=10;i++)
{
cout<<"a["<<i<<"]"<<"=";
cin>>a[i];
}


for(i=1;i<11;i++)
min=a[i];
for(j=i+1;j<11;j++)
if(a[j]<min) 
min=a[j];
temp=a[i];
   a[i]=a[j];
a[j]=temp;
cout<<endl<<"The sorted numbers:"<<endl;
for(i=1;i<=10;i++)
cout<<a[i]<<" ";
cout<<endl;
return 0;
}