分数少，可以说群，然后加入，在群里讨论c++吗？

[StrongHello]

我实在是问题特别多。希望版主谅解。这个又错了，怎么错了。郁闷死了。这般查找。


#include<iostream.h>
#include<iomanip.h>
#define MAX 20
typedef int elemtype;
typedef elemtype recs[MAX];
void ssort(recs A,int n );
void main()
{
recs A={0,2,8,3,6,9,5,1,4,0,7};
int n=10,i;
cout <<"插入排序"<< endl <<"排序前：";
for(i=1;i<=n;i++)
cout << setw(3) << A[i];
cout <<endl;
ssort(A,n);
cout <<"排序后";
for(i=0;i<n;i++)
cout << setw(3) << A[i];
cout <<endl;
}

void ssort(recs B, int m)
{
int i,j,low,mid,high;
for(i=2;i<=m;i++)
{
low=1;high=i-1;mid=(low+high)/2;
B[0]=B[i];
while(low<=high)
{
if(B[0]>B[mid])
mid=low+1;
else
mid=high-1;
}
}
for(j=i-1;j>=high+1;j--)
B[j+1]=B[j];
B[high+1]=B[0];
}

[StrongHello]

监察审计部门进行核实后，情节严重的可被刑事拘留

[StrongHello]

#include<iostream.h>
#include<iomanip.h>
#define MAX 20
typedef int elemtype;
typedef elemtype recs;
void ssort(recs A[],int n );
void main()
{
recs A[]={0,2,8,3,6,9,5,1,4,0,7};
int n=10,i;
cout <<"插入排序"<< endl <<"排序前：";
for(i=1;i<=n;i++)
cout << setw(3) << A[i];
cout <<endl;
ssort(A,n);
cout <<"排序后";
for(i=1;i<=n;i++)
cout << setw(3) << A[i];
cout <<endl;
}

void ssort(recs B[], int m)
{
int i,j,low,mid,high;
for(i=2;i<=m;i++)
{
low=1;high=i-1;
B[0]=B[i];
while(low<=high)
{
mid=(low+high)/2;
if(B[0]>B[mid])
low=mid+1;
else
high=mid-1;

}

for(j=i-1;j>=high+1;j--)
B[j+1]=B[j];
B[high+1]=B[0];
}
}

[virtualxmars]

StringHello~我是Charles,群里那个，把分乖乖交出来~嘿嘿

[qin_pp]

楼主的ssort函数有问题，双重循环出了问题，比较挑不出来，改了一下，但是逻辑上还有问题，但是可以运行结果了，再看看吧！
加了两条语句
#include<iostream.h>
#include<iomanip.h>
#define MAX 20
typedef int elemtype;
typedef elemtype recs[MAX];
void ssort(recs A,int n );
void main()
{
recs A={0,2,8,3,6,9,5,1,4,0,7};
int n=10,i;
cout <<"插入排序"<< endl <<"排序前：";
for(i=1;i<=n;i++)
cout << setw(3) << A[i];
cout <<endl;
ssort(A,n);
cout <<"排序后";
for(i=0;i<n;i++)
cout << setw(3) << A[i];
cout <<endl;
}

void ssort(recs B, int m)
{
int i,j,low,mid,high;
for(i=2;i<=m;i++)
{
low=1;high=i-1;mid=(low+high)/2;
B[0]=B[i];
while(low<=high)
{
if(B[0]>B[mid])
{ mid=low+1;
break;
}
else
{
mid=high-1;
break;
}
}
}
for(j=i-1;j>=high+1;j--)
B[j+1]=B[j];
B[high+1]=B[0];
}