已有一个排好序的数组{3,6,9,23,34,56,78},现输入一个数,要求按原来的排序的规则将它插入数组中.main(){ int a[8]={3,6,9,23,34,56,78},i,loca,t,max;max=a[0];loca=a[0];scanf (
来源:学生作业帮助网 编辑:作业帮 时间:2024/06/30 01:29:57
![已有一个排好序的数组{3,6,9,23,34,56,78},现输入一个数,要求按原来的排序的规则将它插入数组中.main(){ int a[8]={3,6,9,23,34,56,78},i,loca,t,max;max=a[0];loca=a[0];scanf (](/uploads/image/z/5167622-38-2.jpg?t=%E5%B7%B2%E6%9C%89%E4%B8%80%E4%B8%AA%E6%8E%92%E5%A5%BD%E5%BA%8F%E7%9A%84%E6%95%B0%E7%BB%84%7B3%2C6%2C9%2C23%2C34%2C56%2C78%7D%2C%E7%8E%B0%E8%BE%93%E5%85%A5%E4%B8%80%E4%B8%AA%E6%95%B0%2C%E8%A6%81%E6%B1%82%E6%8C%89%E5%8E%9F%E6%9D%A5%E7%9A%84%E6%8E%92%E5%BA%8F%E7%9A%84%E8%A7%84%E5%88%99%E5%B0%86%E5%AE%83%E6%8F%92%E5%85%A5%E6%95%B0%E7%BB%84%E4%B8%AD.main%28%29%7B+int+a%5B8%5D%3D%7B3%2C6%2C9%2C23%2C34%2C56%2C78%7D%2Ci%2Cloca%2Ct%2Cmax%3Bmax%3Da%5B0%5D%3Bloca%3Da%5B0%5D%3Bscanf+%28)
已有一个排好序的数组{3,6,9,23,34,56,78},现输入一个数,要求按原来的排序的规则将它插入数组中.main(){ int a[8]={3,6,9,23,34,56,78},i,loca,t,max;max=a[0];loca=a[0];scanf (
已有一个排好序的数组{3,6,9,23,34,56,78},现输入一个数,要求按原来的排序的规则将它插入数组中.
main()
{ int a[8]={3,6,9,23,34,56,78},i,loca,t,max;
max=a[0];loca=a[0];
scanf (
已有一个排好序的数组{3,6,9,23,34,56,78},现输入一个数,要求按原来的排序的规则将它插入数组中.main(){ int a[8]={3,6,9,23,34,56,78},i,loca,t,max;max=a[0];loca=a[0];scanf (
#include
#include
int main()
{
int a[20] = {3,6,9,23,34,56,78};
int i,n;
int flag = 0;
printf("Input:");
scanf("%d",&n);
//需要知道有原先几个数
for (i = 6; n ,n < a[i] && i >= 0; i--)
{
a[i + 1] = a[i];
a[i] = n;
flag = 1;
}
if (flag == 0)
{
a[i + 1] = n;
}
for (i = 0; i < 8; i++)
{
printf("%d ",a[i]);
}
return 0;
}