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

为班级30个人的姓名设计一个哈希表，假设姓名用汉语拼音表示。（关键字可视为拼音首字母的序号）要求用除留余数法构造哈希函数，用线性探测再散列法处理冲突，平均查找长度的上限是2。#include#includeusing namespace std;#define M 47 /随机数#define n 50 /哈希表长#define q 30 /人数struct name char *py; int k;name NameListn;struct hash char *py; int k; int si;hash hashlistn;void listname() char *f; int s0,r,i; NameList0.py=baojie; NameList1.py=chengaoyang; NameList2.py=chenguangzhong; NameList3.py=chenliangliang; NameList4.py=chenyongzhou; NameList5.py=fengchao; NameList6.py=gexiangfeng; NameList7.py=huting; NameList8.py=huangpinjin; NameList9.py=jiangxiaojia; NameList10.py=laidongjie; NameList11.py=liyexiao; NameList12.py=lidaohui; NameList13.py=lijue; NameList14.py=lizhuoqun; NameList15.py=linfujun; NameList16.py=luobin; NameList17.py=luokeqing; NameList18.py=nichao; NameList19.py=panhuafeng; NameList20.py=sijun; NameList21.py=songzhanhui; NameList22.py=sunzhengqing; NameList23.py=wanghaofeng; NameList24.py=wangjunshuai; NameList25.py=wangqinde; NameList26.py=wangzejun; NameList27.py=wangkeke; NameList28.py=weixing; NameList29.py=wurenke; for(i=0;iq;i+) s0=0; f=NameListi.py; for(r=0;*(f+r)!=0;r+) s0+=*(f+r); NameListi.k=s0; void creathash() int i; for(i=0;in;i+) hashlisti.py=; hashlisti.k=0; hashlisti.si=0; for(i=0;iM;i+) int sum=0; int adr=(NameListi.k)%M; int d=adr; if(hashlistadr.si=0) hashlistadr.k=NameListi.k; hashlistadr.py=NameListi.py; hashlistadr.si=1; else while(hashlistd.k!=0) d=(d+NameListi.k%10+1)%M; sum=sum+1; hashlistd.k=NameListi.k; hashlistd.py=NameListi.py; hashlistd.si=sum+1; void findlist() string nam; int s0=0,r,sum=1; cout请输入姓名的拼音：nam; for(r=0;r20;r+) s0+=namr; int adr=s0%M; int d=adr; if(hashlistadr.k=s0) cout姓名：hashlistadr.py 关键字：s0 查找长度为：1endl; else if(hashlistadr.k=0) cout无此记录！endl; else int g=0; while(g=0) d=(d+s0%10+1)%M; sum=sum+1; if(hashlistd.k=0) cout无此记录！endl; g=1; if(hashlistd.k=s0) cout姓名：hashlistadr.py 关键字：s0 查找长度为：1endl; g=1; void display() int i; for(i=0;i30;i+) coutNameListi.py NameListi.kendl;int main() char x; listname(); creathash(); coutd.