插入排序从后插入版本
void cha(int wu[])
{
int m,n, i,temp;
for (i = 0; wu[i] != 0; i++);
i--;
//temp = wu[i];
if (wu[i] < wu[i - 1])
{
temp = wu[i];
wu[i] = wu[i - 1];
wu[i-1] = temp;
}
for (n=2;i-n>=0;n++)
{
for (m=i-n;m<i;m++)
{
if (wu[m] > wu[m + 1])
{
temp = wu[m];
wu[m] = wu[m + 1];
wu[m + 1] = temp;
}
else
break;
}
}
}
``