广工数据数据结构课程设计 哈希表

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define OVERFLOW -1
#define OK 1
#define SUCCESS 1
#define UNSUCCESS -1
#define MAXSIZE 50
typedef struct Node {
char name[20];
char number[20];
char phone[11];
char address[20];
}Node;

typedef struct {
Node *rcd;
int size;
int count;
int *tag;
int (*hash)(char *key,int hashSize);
void (*collision)(int * hashValue,int hashSize);
}HashTable;

int hash(char *name)
{
int i=0,a=0;
while(name[i]!=0)
{
a+=(int)name[i];
i++;
}
a = a%9;
return a;
}

void collision(int * hashValue,int hashSize)
{
*hashValue = (*hashValue+1)%hashSize;
}

int InitHash(HashTable *H,int size,int (*hash)(char,int),void (*collision)(int *,i