为班级30个人的姓名设计一个哈希表,假设姓名用汉语拼音表示.....docxVIP

为班级30个人的姓名设计一个哈希表，假设姓名用汉语拼音表示。（关键字可视为拼音首字母的序号）要求用除留余数法构造哈希函数，用线性探测再散列法处理冲突，平均查找长度的上限是2。#includeiostream#includestringusing namespace std;#define M 47 //随机数#define n 50 //哈希表长#define q 30 //人数struct name{ char *py;int k;};name NameList[n];struct hash{ char *py;int k;intsi;};hash hashlist[n];void listname(){ char *f;int s0,r,i;NameList[0].py=baojie;NameList[1].py=chengaoyang;NameList[2].py=chenguangzhong;NameList[3].py=chenliangliang;NameList[4].py=chenyongzhou;NameList[5].py=fengchao;NameList[6].py=gexiangfeng;NameList[7].py=huting;NameList[8].py=huangpinjin;NameList[9].py=jiangxiaojia;NameList[10].py=laidongjie;NameList[11].py=liyexiao;NameList[12].py=lidaohui;NameList[13].py=lijue;NameList[14].py=lizhuoqun;NameList[15].py=linfujun;NameList[16].py=luobin;NameList[17].py=luokeqing;NameList[18].py=nichao;NameList[19].py=panhuafeng;NameList[20].py=sijun;NameList[21].py=songzhanhui; NameList[22].py=sunzhengqing;NameList[23].py=wanghaofeng;NameList[24].py=wangjunshuai;NameList[25].py=wangqinde;NameList[26].py=wangzejun;NameList[27].py=wangkeke;NameList[28].py=weixing;NameList[29].py=wurenke; for(i=0;iq;i++) { s0=0; f=NameList[i].py; for(r=0;*(f+r)!=\0;r++) s0+=*(f+r);NameList[i].k=s0; }}void creathash(){inti; for(i=0;in;i++) {hashlist[i].py=;hashlist[i].k=0;hashlist[i].si=0; } for(i=0;iM;i++) {int sum=0;intadr=(NameList[i].k)%M;int d=adr; if(hashlist[adr].si==0) {hashlist[adr].k=NameList[i].k;hashlist[adr].py=NameList[i].py;hashlist[adr].si=1; } else { while(hashlist[d].k!=0) { d=(d+NameList[i].k%10+1)%M; sum=sum+1; }hashlist[d].k=NameList[i].k;hashlist[d].py=NameList[i].py;hashlist[d].si=sum+1; } }}void findlist(){ string nam;int s0=0,r,sum=1;cout请输入姓名的拼音：endl;cinnam; for(r=0;r20;r++) s0+=nam[r];intadr=s0%M;int d=adr; if(hashlist[adr].k==s0)cout姓名：hashlist[adr].py 关键字：s0 查找长度为：1endl; else if(hashlist[adr].k==0)cout无此记录！endl; else {int g=0; while(g==0) { d=(d+s0%10+1)%M; sum=sum+1; if(hashlist[d].k==0) {cout无此记录！endl; g=1