1.向有序数组中(从大到小),插入一个数,使数字仍然有序
i = length;
while(x > s[i])
{
s[i+1] = s[i];
i--;
}
s[i+1] = x;
2.使从小到大的数组逆序
for(i = 0 , j = length ; i != j ; i++,j--)
{
int x = s[i];
s[i] = s[j];
s[j] = x;
}
1.向有序数组中(从大到小),插入一个数,使数字仍然有序
i = length;
while(x > s[i])
{
s[i+1] = s[i];
i--;
}
s[i+1] = x;
2.使从小到大的数组逆序
for(i = 0 , j = length ; i != j ; i++,j--)
{
int x = s[i];
s[i] = s[j];
s[j] = x;
}