资源简介
首先采用除留余数法建立哈希表,然后使用链地址法避免哈希表冲突,
代码片段和文件信息
//#include “stdafx.h“
#include
#include
#include
#define MAX_HASH_SIZE 400
#define MAX_APP_NAME_LEN 30
typedef struct HASH_ELEM
{
char app_name[MAX_APP_NAME_LEN];
unsigned char app_type;
struct HASH_ELEM *next;
}HASH_ELEM *HashList;
/*struct HASH_ELEM
{
char app_name[MAX_APP_NAME_LEN];
unsigned char app_type;
};*/
unsigned short HashConstructFunc(const char *name unsigned char app_type);
//void InitHashTable();
struct HASH_ELEM g_hashtable[MAX_HASH_SIZE];
//struct HASH_ELEM g_hashtable[MAX_HASH_SIZE];
void InitHashTable()
{
memset(g_hashtable 0 MAX_HASH_SIZE*sizeof(struct HASH_ELEM));
FILE *fp=fopen(“AppList.dat“ “r“);
if(!fp)return;
char name[MAX_APP_NAME_LEN];
unsigned char type;
- 上一篇:个人收支管理——C语言编写
- 下一篇:C语言 点特征提取
评论
共有 条评论