void SortArray()
{
int arr1[5] = { 2,5,3,1,4 };
int len = 5;
int k = 0;
while(k<len-1)
{
for (int i=0;i<len-1-k;i++)//每次循环最大值被选出,故可以省略一次循环:len-1-k
{
if (arr1[i] > arr1[i + 1])
{
int t = arr1[i];
arr1[i] = arr1[i + 1];
arr1[i + 1] = t;
}
}
k++;
}
for (int x=0;x<len;x++)
{
printf("%d", arr1[x]);
}
}