namespace HashSearch.CSharp
{class Program{//初始化哈希表static int hashLength = 7;static int[] hashTable= new int[hashLength];//原始数据static List<int> list = new List<int>() { 13,29,27,28,26,30,38 };static void Main(string[] args){Console.WriteLine("********************哈希查找(C#版)********************\n");//创建哈希表for (int i = 0; i < list.Count; i++){Insert(hashTable,list[i]);}Console.WriteLine("展示哈希表中的数据：{0}",String.Join(",",hashTable));while (true){//哈希表查找Console.Write("请输入要查找的数据:");int data = int.Parse(Console.ReadLine());var result = Search(hashTable, data);if (result == -1) Console.WriteLine("对不起，没有找到!");else Console.WriteLine("数据的位置是：{0}", result);}}/// <summary>/// 哈希表插入/// </summary>/// <param name="hashTable">哈希表</param>/// <param name="data">待插入值</param>public static void Insert(int[] hashTable, int data){ //哈希函数,除留余数法int hashAddress = Hash(hashTable,data);//如果不为0，则说明发生冲突while (hashTable[hashAddress] != 0){//利用开放定址的线性探测法解决冲突hashAddress = (++hashAddress) % hashTable.Length;}//将待插入值存入字典中hashTable[hashAddress] = data;}/// <summary>/// 哈希表查找/// </summary>/// <param name="hashTable">哈希表</param>/// <param name="data">待查找的值</param>/// <returns></returns>public static int Search(int[] hashTable, int data){//哈希函数,除留余数法int hashAddress = Hash(hashTable,data);//冲突发生while (hashTable[hashAddress] != data){//利用开放定址的线性探测法解决冲突hashAddress = (++hashAddress) % hashTable.Length;//查找到了开放单元或者循环回到原点，表示查找失败if (hashTable[hashAddress] == 0 || hashAddress==Hash(hashTable,data)) return -1;}//查找成功,返回值的下标return hashAddress;}/// <summary>/// 哈希函数(除留余数法)/// </summary>/// <param name="hashTable">待操作哈希表</param>/// <param name="data"></param>/// <returns>返回数据的位置</returns>public static int Hash(int[] hashTable, int data){return data % hashTable.Length;}}
}

#include "stdio.h"
#include "stdlib.h"
#include "io.h"
#include "math.h"
#include "time.h"#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define SUCCESS 1
#define UNSUCCESS 0#define HASHSIZE 7 /* 定义散列表长为数组的长度 */
#define NULLKEY -32768 typedef int Status;
typedef struct
{int *elem; /* 数据元素存储地址，动态分配数组 */int count; /*  当前数据元素个数 */
}HashTable;int m=0; /* 散列表表长，全局变量 *//*初始化*/
Status Init(HashTable *hashTable)
{int i;m=HASHSIZE;hashTable->elem= (int *)malloc(m*sizeof(int)); //申请内存hashTable->count=m;for (i=0;i<m;i++){hashTable->elem[i]=NULLKEY;}return OK;
}/*哈希函数(除留余数法)*/
int Hash(int data)
{return data%m;
}/*插入*/
void Insert(HashTable *hashTable,int data)
{int hashAddress=Hash(data); //求哈希地址//发生冲突while(hashTable->elem[hashAddress]!=NULLKEY){//利用开放定址的线性探测法解决冲突hashAddress=(++hashAddress)%m;}//插入值hashTable->elem[hashAddress]=data;
}/*查找*/
int Search(HashTable *hashTable,int data)
{int hashAddress=Hash(data); //求哈希地址//发生冲突while(hashTable->elem[hashAddress]!=data){//利用开放定址的线性探测法解决冲突hashAddress=(++hashAddress)%m;if (hashTable->elem[hashAddress]==NULLKEY||hashAddress==Hash(data)) return -1;}//查找成功return hashAddress;
}/*打印结果*/
void Display(HashTable *hashTable)
{int i;printf("\n**********展示结果**********\n");for (i=0;i<hashTable->count;i++){printf("%d ",hashTable->elem[i]);}printf("\n**********展示完毕**********\n");
}void main()
{int i,j,result;HashTable hashTable;int arr[HASHSIZE]={13,29,27,28,26,30,38};printf("***************哈希查找(C语言版)***************\n");//初始化哈希表Init(&hashTable);//插入数据for (i=0;i<HASHSIZE;i++){Insert(&hashTable,arr[i]);}Display(&hashTable);//查找数据result= Search(&hashTable,29);if (result==-1) printf("对不起，没有找到！");else printf("29在哈希表中的位置是:%d",result);getchar();
}