冒泡排序

#include<iostream>
using namespace std;
int main()
{
int a[11];
int i,j,t,k;
cout<<"input 10 numbers:"<<endl;
for(i=1;i<11;i++)
cin>>a[i];
cout<<endl;
for(j=1;j<11;j++)
for(k=1;k<11-j;k++)
{
if(a[k]>a[k+1])
{ t=a[k];
   a[k]=a[k+1];
a[k+1]=t;
}
}
cout<<"the sorted numbers:"<<endl;
for(i=1;i<11;i++)
cout<<a[i]<<" ";
cout<<endl;
return 0;
}