数据结构使用c语言算法实现

# include<stdio.h> typedef int keytype; typedef struct chain { keytype Key; struct chain *Next; } chaintype; chaintype *HashSeach(chaintype *a[], keytype Key, int( *Hash)(), int Mod); int HashInsert(chaintype *a[], keytype Key, int(* Hash)(),int Mod); int Hash1(keytype Key, int Mod); main() { int i,Key, Mod=10; int Test[10]={1,2,3,4,5,6,66,666,7,11,}; chaintype *a[10],*p; int (*Hash)(); for(i=0;i<10;i++) a[i]=NULL; Hash=Hash1; for(i=0;i<10;i++) { HashInsert(a,Test[i],Hash,Mod); } Key=666; p=HashSeach(a,Key,Hash,Mod); if(p!=NULL)printf("\n查找成功!"); else printf("\查找失败!"); } chaintype *HashSeach(chaintype *a[],keytype Key,int (*Hash)(),int Mod) { chaintype *p; int i; i=(*Hash)(Key,Mod); p=a[i]; while(p!=NULL&&p->Key!=Key) p=p->Next; if(p==NULL)return NULL; else return p; } int HashInsert(chaintype *a[],keytype Key,int (*Hash)(),int Mod) { chaintype *pre,*cur; int i; i=(*Hash)(Key,Mod); pre=a[i]; cur=cura[i]; while(cur!=NULL&&cur->Key!=Key) { pre=cur; cur->Next; } if(cur==NULL) { cur=(chaintype * )malloc(sizeof(chaintype)); cur->Key=Key; cur->Next=NULL; if(a[i]==NULL) a[i]=cur; else pre->Next=cur; return 1; } return 0; } int Hash1(keytype key, int Mod) { return key % Mod; }