跪求大家前来指点，c++课程设计~~

来源：百度知道 编辑：UC知道 时间：2024/06/04 09:23:37
#include <iostream.h>
struct elemtype
{int key;
int no;
char name[20];
char sex[10];
char add[20];
char date[20];
};

int seqs(elemtype a[],int n,int k)//基本算法
{
for(int i=0;i<n;i++)
if(a[i].key==k)
break;
if(i<n) return i;
else
return -1;
}

int seqsch(elemtype a[],int n,int k)//改进算法
{a[n].key=k;
for(int i=0;;i++)
if(a[i].key==k) break;
if(i<n) return i;
else
return -1;
}

void main()
{elemtype a[5];
int maxsize=100,n=5;
a[0]={1,98131,"小三","男","北京","1979.12"};
a[1]={2,98164,"刘二","女","南京","1979.3"};
a[2]={3,98165,"王五","男","天津","1988.3"};
a[3]={4,98182,"赵强","男","上海","1975.5"};
a[4]={5,98203,"钱小","女","淮安",&q

都是常规错误，自己看看吧，改过的地方我做了标记////////
#include <iostream> ////////
using namespace std; ////////
struct elemtype
{int key;
int no;
char name[20];
char sex[10];
char add[20];
char date[20];
};

int seqs(elemtype a[],int n,int k)//基本算法
{
for(int i=0;i<n;i++)
if(a[i].key==k)
break;
if(i<n) return i;
else
return -1;
}

int seqsch(elemtype a[],int n,int k)//改进算法
{a[n].key=k;
for(int i=0;;i++)
if(a[i].key==k) break;
if(i<n) return i;
else
return -1;
}

void main()
{
int maxsize=100, n=5;
elemtype a[5]={ ////////

{1,98131,"小三","男","北京","1979.12"},
{2,98164,"刘二","女","南京","1979.3"},
{3,98165,"王五","男","天津","1988.3"},
{4,98182,"赵强","男","上海"