假设散列表长为m，散列函数为H(K)，用链地址冲突处理。试编写输入一组关键字构造散列表的算法。 typedef struct HNode{ int data; struct HNode*next; };HNode,*Hlist; void CreatHlist(Hlist L[],int m){ int i; HNode * s; for(i = 0;i < m;i++) L[i] = null; scanf(x); while(x != '#'){ h=Hash(x); s=(HNode *)malloc(sizeof(HNode)); s-> data = x; s-> …

已知两个有序表A[0...n-1]和B[0...m-1]，试写一算法，将他们归并为一个有序表C[0...m+n-1]。 #define Maxsize (m + n) typedef int ElenType; typedef struct { ElenType data[Maxsize]; int length; } Sqlist; bool Merge(Sqlist A, Sqlist B, Sqlist &C) { if (A.length + B.length > C.Maxsize) return false; int i = 0, j = 0, k = 0; whil…